CSES - Aalto Competitive Programming 2024 - wk8 - Mon - Results
Submission details
Task:Illuminati
Sender:Niilo
Submission time:2024-10-28 16:52:38 +0200
Language:C++ (C++17)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#40.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#80.00 sdetails
#9ACCEPTED0.00 sdetails
#100.00 sdetails
#11ACCEPTED0.00 sdetails
#120.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.00 sdetails
#160.00 sdetails
#17ACCEPTED0.00 sdetails
#180.00 sdetails
#190.00 sdetails
#20ACCEPTED0.00 sdetails
#210.00 sdetails
#220.00 sdetails
#23ACCEPTED0.00 sdetails
#240.00 sdetails
#25ACCEPTED0.00 sdetails
#26ACCEPTED0.00 sdetails
#27ACCEPTED0.00 sdetails
#280.00 sdetails
#290.00 sdetails
#300.00 sdetails
#310.00 sdetails
#320.00 sdetails
#330.00 sdetails
#340.00 sdetails
#350.00 sdetails
#360.00 sdetails
#370.00 sdetails
#380.00 sdetails
#390.01 sdetails
#400.00 sdetails
#410.00 sdetails
#420.00 sdetails
#430.01 sdetails
#440.00 sdetails
#450.01 sdetails
#460.00 sdetails
#470.00 sdetails
#480.08 sdetails
#490.08 sdetails
#500.26 sdetails
#510.26 sdetails
#520.47 sdetails
#530.59 sdetails

Code

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int N = 3008;
ll A[N*N/64];

void setb(int i, int j) {
  int d = i * N + j;
  A[d / 64] |= 1ull<<(d % 64);
}

bool getb(int i, int j) {
  int d = i * N + j;
  return A[d/64] & (1ull<<(d % 64));
}

int main() {
  int n;
  string s;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> s;
    for (int j = 0; j < n; ++j) {
      if (s[j] == '1') setb(i,j);
    }
  }
  ll ans = 0;
  for (int i = 0; i < n; ++i) {
    for (int j = i+1; j < n; ++j) {
      if (!getb(i,j)) continue;
      int i0 = i*N+j+1;
      int j0 = j*N+j+1;
      int a0 = (j+1) % 64;
      ans += __builtin_popcountll((A[i0/64] & A[j0/64]) & ~((1ull<<a0)-1));
      i0 /= 64; j0 /= 64;
      for (; i0 < (i*N+N)/64; ++i0, ++j0) {
        ans += __builtin_popcountll(A[i0] & A[j0]);
      }
    }
  }
  cout << ans << '\n';
}

Test details

Test 1

Verdict: ACCEPTED

input
1
0

correct output
0

user output
0

Test 2

Verdict: ACCEPTED

input
2
01
10

correct output
0

user output
0

Test 3

Verdict: ACCEPTED

input
2
01
10

correct output
0

user output
0

Test 4

Verdict:

input
3
011
101
110

correct output
1

user output
4

Test 5

Verdict: ACCEPTED

input
3
010
101
010

correct output
0

user output
0

Test 6

Verdict: ACCEPTED

input
3
000
001
010

correct output
0

user output
0

Test 7

Verdict: ACCEPTED

input
3
011
100
100

correct output
0

user output
0

Test 8

Verdict:

input
4
0111
1011
1101
1110

correct output
4

user output
16

Test 9

Verdict: ACCEPTED

input
4
0011
0010
1100
1000

correct output
0

user output
0

Test 10

Verdict:

input
4
0000
0011
0101
0110

correct output
1

user output
4

Test 11

Verdict: ACCEPTED

input
4
0101
1010
0100
1000

correct output
0

user output
0

Test 12

Verdict:

input
4
0111
1001
1001
1110

correct output
2

user output
8

Test 13

Verdict: ACCEPTED

input
4
0001
0010
0100
1000

correct output
0

user output
0

Test 14

Verdict: ACCEPTED

input
4
0110
1001
1000
0100

correct output
0

user output
0

Test 15

Verdict: ACCEPTED

input
4
0001
0000
0001
1010

correct output
0

user output
0

Test 16

Verdict:

input
4
0101
1001
0000
1100

correct output
1

user output
4

Test 17

Verdict: ACCEPTED

input
4
0001
0000
0000
1000

correct output
0

user output
0

Test 18

Verdict:

input
5
01111
10111
11010
11101
...

correct output
7

user output
28

Test 19

Verdict:

input
5
00111
00000
10010
10100
...

correct output
1

user output
4

Test 20

Verdict: ACCEPTED

input
5
00001
00110
01000
01000
...

correct output
0

user output
0

Test 21

Verdict:

input
5
01011
10001
00011
10100
...

correct output
1

user output
4

Test 22

Verdict:

input
5
01110
10111
11011
11101
...

correct output
7

user output
28

Test 23

Verdict: ACCEPTED

input
5
00011
00001
00010
10100
...

correct output
0

user output
0

Test 24

Verdict:

input
5
01100
10100
11000
00001
...

correct output
1

user output
4

Test 25

Verdict: ACCEPTED

input
5
00010
00011
00001
11000
...

correct output
0

user output
0

Test 26

Verdict: ACCEPTED

input
5
01010
10101
01010
10100
...

correct output
0

user output
0

Test 27

Verdict: ACCEPTED

input
5
00010
00000
00000
10000
...

correct output
0

user output
0

Test 28

Verdict:

input
10
0111111110
1011000101
1100001110
1100101100
...

correct output
26

user output
104

Test 29

Verdict:

input
10
0011100010
0000000010
1001110011
1010001001
...

correct output
11

user output
44

Test 30

Verdict:

input
10
0000111000
0000001100
0000011111
0000001101
...

correct output
7

user output
28

Test 31

Verdict:

input
10
0101100111
1001000000
0000010000
1100100010
...

correct output
9

user output
36

Test 32

Verdict:

input
10
0111011111
1010010010
1101011001
1010101100
...

correct output
22

user output
88

Test 33

Verdict:

input
10
0001100110
0001010100
0001010111
1110000110
...

correct output
11

user output
44

Test 34

Verdict:

input
10
0110010000
1011011010
1100110110
0100101011
...

correct output
22

user output
88

Test 35

Verdict:

input
10
0001001101
0001010000
0000011110
1100000101
...

correct output
13

user output
52

Test 36

Verdict:

input
10
0101010110
1000101001
0001011011
1010101110
...

correct output
8

user output
32

Test 37

Verdict:

input
10
0001000000
0000100000
0000000010
1000110111
...

correct output
19

user output
76

Test 38

Verdict:

input
100
011111111011000101000111010110...

correct output
20807

user output
49034

Test 39

Verdict:

input
100
001110001000000010111001100100...

correct output
21100

user output
50316

Test 40

Verdict:

input
100
000011100000001100001111100110...

correct output
18556

user output
45351

Test 41

Verdict:

input
100
010110011101000000001000010001...

correct output
20091

user output
47789

Test 42

Verdict:

input
100
011101111110010010101100110110...

correct output
21281

user output
51053

Test 43

Verdict:

input
100
000110011001010100101011100011...

correct output
20746

user output
50785

Test 44

Verdict:

input
100
011001000011011010011011010101...

correct output
21793

user output
52511

Test 45

Verdict:

input
100
000100110101010000001111000010...

correct output
19781

user output
46789

Test 46

Verdict:

input
100
010101011000101001101101110111...

correct output
20006

user output
46965

Test 47

Verdict:

input
100
000100000000100000000001011011...

correct output
19161

user output
45500

Test 48

Verdict:

input
1000
011111111011000101000111010110...

correct output
20823418

user output
24622632

Test 49

Verdict:

input
1000
001110001000000010111001100100...

correct output
20848491

user output
24637434

Test 50

Verdict:

input
2000
010001011010001100000111100111...

correct output
166808034

user output
182385708

Test 51

Verdict:

input
2000
000010011000001011011110111110...

correct output
165842024

user output
181272085

Test 52

Verdict:

input
2999
000110011001010001100011110110...

correct output
561389670

user output
596623305

Test 53

Verdict:

input
3000
011111111111111111111111111111...

correct output
4495501000

user output
4777529484