CSES - Aalto Competitive Programming 2024 - wk8 - Mon - Results
Submission details
Task:Illuminati
Sender:Farah
Submission time:2024-10-28 17:32:22 +0200
Language:C++ (C++11)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.00 sdetails
#16ACCEPTED0.00 sdetails
#17ACCEPTED0.00 sdetails
#18ACCEPTED0.00 sdetails
#19ACCEPTED0.00 sdetails
#20ACCEPTED0.00 sdetails
#21ACCEPTED0.00 sdetails
#22ACCEPTED0.00 sdetails
#23ACCEPTED0.00 sdetails
#24ACCEPTED0.00 sdetails
#25ACCEPTED0.00 sdetails
#26ACCEPTED0.00 sdetails
#27ACCEPTED0.00 sdetails
#28ACCEPTED0.00 sdetails
#29ACCEPTED0.00 sdetails
#30ACCEPTED0.00 sdetails
#31ACCEPTED0.00 sdetails
#32ACCEPTED0.00 sdetails
#33ACCEPTED0.00 sdetails
#34ACCEPTED0.00 sdetails
#35ACCEPTED0.00 sdetails
#36ACCEPTED0.00 sdetails
#37ACCEPTED0.00 sdetails
#380.00 sdetails
#390.00 sdetails
#400.00 sdetails
#410.00 sdetails
#420.00 sdetails
#430.00 sdetails
#440.00 sdetails
#450.00 sdetails
#460.00 sdetails
#470.00 sdetails
#480.03 sdetails
#490.03 sdetails
#500.21 sdetails
#510.21 sdetails
#520.63 sdetails
#531.15 sdetails

Code

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

typedef unsigned long long ull;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int n;
    cin >> n;
    int word_cnt = (n + 63) / 64;
    vector<ull> adj(n * word_cnt, 0ULL);
    
    for(int i=0; i<n; i++){
        string s;
        cin >> s;
        for(int j=0; j<n; j++){
            if(s[j] == '1'){
                int w = j /64;
                int b = j %64;
                adj[i * word_cnt + w] |= (1ULL << b);
            }
        }
    }
    
    unsigned long long count =0;
    for(int u=0; u<n; u++){
        int word_u = u /64;
        int bit_u = u %64;
        for(int w_idx = word_u; w_idx < word_cnt; w_idx++){
            ull mask;
            if(w_idx == word_u){
                mask = (~0ULL) << (bit_u +1);
            }
            else{
                mask = ~0ULL;
            }
            if(w_idx == word_cnt -1 && (n %64)!=0){
                mask &= (n %64) ? ((1ULL << (n %64)) -1) : ~0ULL;
            }
            ull w = adj[u * word_cnt + w_idx] & mask;
            while(w){
                ull lsb = w & -w;
                int pos = __builtin_ctzll(w);
                int v = w_idx *64 + pos;
                if(v >=n) break;
                unsigned int tmp_count =0;
                for(int m=0; m<word_cnt; m++){
                    tmp_count += __builtin_popcountll(adj[u * word_cnt +m] & adj[v * word_cnt +m]);
                }
                count += tmp_count;
                w ^= lsb;
            }
        }
    }
    cout << (count /3) << "\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: ACCEPTED

input
3
011
101
110

correct output
1

user output
1

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: ACCEPTED

input
4
0111
1011
1101
1110

correct output
4

user output
4

Test 9

Verdict: ACCEPTED

input
4
0011
0010
1100
1000

correct output
0

user output
0

Test 10

Verdict: ACCEPTED

input
4
0000
0011
0101
0110

correct output
1

user output
1

Test 11

Verdict: ACCEPTED

input
4
0101
1010
0100
1000

correct output
0

user output
0

Test 12

Verdict: ACCEPTED

input
4
0111
1001
1001
1110

correct output
2

user output
2

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: ACCEPTED

input
4
0101
1001
0000
1100

correct output
1

user output
1

Test 17

Verdict: ACCEPTED

input
4
0001
0000
0000
1000

correct output
0

user output
0

Test 18

Verdict: ACCEPTED

input
5
01111
10111
11010
11101
...

correct output
7

user output
7

Test 19

Verdict: ACCEPTED

input
5
00111
00000
10010
10100
...

correct output
1

user output
1

Test 20

Verdict: ACCEPTED

input
5
00001
00110
01000
01000
...

correct output
0

user output
0

Test 21

Verdict: ACCEPTED

input
5
01011
10001
00011
10100
...

correct output
1

user output
1

Test 22

Verdict: ACCEPTED

input
5
01110
10111
11011
11101
...

correct output
7

user output
7

Test 23

Verdict: ACCEPTED

input
5
00011
00001
00010
10100
...

correct output
0

user output
0

Test 24

Verdict: ACCEPTED

input
5
01100
10100
11000
00001
...

correct output
1

user output
1

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: ACCEPTED

input
10
0111111110
1011000101
1100001110
1100101100
...

correct output
26

user output
26

Test 29

Verdict: ACCEPTED

input
10
0011100010
0000000010
1001110011
1010001001
...

correct output
11

user output
11

Test 30

Verdict: ACCEPTED

input
10
0000111000
0000001100
0000011111
0000001101
...

correct output
7

user output
7

Test 31

Verdict: ACCEPTED

input
10
0101100111
1001000000
0000010000
1100100010
...

correct output
9

user output
9

Test 32

Verdict: ACCEPTED

input
10
0111011111
1010010010
1101011001
1010101100
...

correct output
22

user output
22

Test 33

Verdict: ACCEPTED

input
10
0001100110
0001010100
0001010111
1110000110
...

correct output
11

user output
11

Test 34

Verdict: ACCEPTED

input
10
0110010000
1011011010
1100110110
0100101011
...

correct output
22

user output
22

Test 35

Verdict: ACCEPTED

input
10
0001001101
0001010000
0000011110
1100000101
...

correct output
13

user output
13

Test 36

Verdict: ACCEPTED

input
10
0101010110
1000101001
0001011011
1010101110
...

correct output
8

user output
8

Test 37

Verdict: ACCEPTED

input
10
0001000000
0000100000
0000000010
1000110111
...

correct output
19

user output
19

Test 38

Verdict:

input
100
011111111011000101000111010110...

correct output
20807

user output
21042

Test 39

Verdict:

input
100
001110001000000010111001100100...

correct output
21100

user output
21401

Test 40

Verdict:

input
100
000011100000001100001111100110...

correct output
18556

user output
18743

Test 41

Verdict:

input
100
010110011101000000001000010001...

correct output
20091

user output
20366

Test 42

Verdict:

input
100
011101111110010010101100110110...

correct output
21281

user output
21719

Test 43

Verdict:

input
100
000110011001010100101011100011...

correct output
20746

user output
20972

Test 44

Verdict:

input
100
011001000011011010011011010101...

correct output
21793

user output
22084

Test 45

Verdict:

input
100
000100110101010000001111000010...

correct output
19781

user output
20090

Test 46

Verdict:

input
100
010101011000101001101101110111...

correct output
20006

user output
20313

Test 47

Verdict:

input
100
000100000000100000000001011011...

correct output
19161

user output
19409

Test 48

Verdict:

input
1000
011111111011000101000111010110...

correct output
20823418

user output
20864263

Test 49

Verdict:

input
1000
001110001000000010111001100100...

correct output
20848491

user output
20887048

Test 50

Verdict:

input
2000
010001011010001100000111100111...

correct output
166808034

user output
166967141

Test 51

Verdict:

input
2000
000010011000001011011110111110...

correct output
165842024

user output
166005173

Test 52

Verdict:

input
2999
000110011001010001100011110110...

correct output
561389670

user output
561756028

Test 53

Verdict:

input
3000
011111111111111111111111111111...

correct output
4495501000

user output
4498397068