CSES - Aalto Competitive Programming 2024 - wk8 - Mon - Results
Submission details
Task:Illuminati
Sender:ZDHKLV
Submission time:2024-10-28 17:49:40 +0200
Language:C++ (C++20)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#20.00 sdetails
#30.00 sdetails
#4ACCEPTED0.00 sdetails
#50.00 sdetails
#60.00 sdetails
#70.00 sdetails
#80.00 sdetails
#90.00 sdetails
#100.00 sdetails
#110.00 sdetails
#12ACCEPTED0.00 sdetails
#130.00 sdetails
#140.00 sdetails
#150.00 sdetails
#160.00 sdetails
#170.00 sdetails
#180.00 sdetails
#190.00 sdetails
#200.00 sdetails
#210.00 sdetails
#220.00 sdetails
#230.00 sdetails
#240.00 sdetails
#250.00 sdetails
#260.00 sdetails
#270.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.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.08 sdetails
#490.08 sdetails
#500.30 sdetails
#510.30 sdetails
#520.67 sdetails
#530.68 sdetails

Code

#include <bits/stdc++.h>

using namespace std;

int dfs(int x, vector<vector<int>> &adj, vector<bool> &visited, int n) {

    queue<pair<int, int>> q;

    q.push({x, 1});

    int r = 1;

    while (!q.empty()) {

        pair<int, int> p = q.front();
        q.pop();

        int y = p.first;
        int d = p.second;

        visited[y] = true;

        if (d == 3) {
            if (y == x)
                r++;
            continue;
        }

        for (int z : adj[y]) {
            if (!visited[z] || z == x)
            q.push({ z, d+1 });
        }

    }

    return r;

}

int main() {

    int n;
    cin >> n;

    vector<vector<int>> adj(n);

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            char c;
            cin >> c;
            if (c == '1') {
                adj[i].push_back(j);
                //adj[j].push_back(i);
            }
        }
    }

    int r = 0;
    
    vector<bool> visited(n, false);

    for (int i = 0; i < n; i++) {
        if (!visited[i]) {
            r += dfs(i, adj, visited, n);
        }
    }

    cout << r/2 << endl;

}

Test details

Test 1

Verdict: ACCEPTED

input
1
0

correct output
0

user output
0

Test 2

Verdict:

input
2
01
10

correct output
0

user output
1

Test 3

Verdict:

input
2
01
10

correct output
0

user output
1

Test 4

Verdict: ACCEPTED

input
3
011
101
110

correct output
1

user output
1

Test 5

Verdict:

input
3
010
101
010

correct output
0

user output
1

Test 6

Verdict:

input
3
000
001
010

correct output
0

user output
1

Test 7

Verdict:

input
3
011
100
100

correct output
0

user output
1

Test 8

Verdict:

input
4
0111
1011
1101
1110

correct output
4

user output
2

Test 9

Verdict:

input
4
0011
0010
1100
1000

correct output
0

user output
1

Test 10

Verdict:

input
4
0000
0011
0101
0110

correct output
1

user output
2

Test 11

Verdict:

input
4
0101
1010
0100
1000

correct output
0

user output
1

Test 12

Verdict: ACCEPTED

input
4
0111
1001
1001
1110

correct output
2

user output
2

Test 13

Verdict:

input
4
0001
0010
0100
1000

correct output
0

user output
2

Test 14

Verdict:

input
4
0110
1001
1000
0100

correct output
0

user output
1

Test 15

Verdict:

input
4
0001
0000
0001
1010

correct output
0

user output
1

Test 16

Verdict:

input
4
0101
1001
0000
1100

correct output
1

user output
2

Test 17

Verdict:

input
4
0001
0000
0000
1000

correct output
0

user output
2

Test 18

Verdict:

input
5
01111
10111
11010
11101
...

correct output
7

user output
2

Test 19

Verdict:

input
5
00111
00000
10010
10100
...

correct output
1

user output
2

Test 20

Verdict:

input
5
00001
00110
01000
01000
...

correct output
0

user output
2

Test 21

Verdict:

input
5
01011
10001
00011
10100
...

correct output
1

user output
2

Test 22

Verdict:

input
5
01110
10111
11011
11101
...

correct output
7

user output
2

Test 23

Verdict:

input
5
00011
00001
00010
10100
...

correct output
0

user output
1

Test 24

Verdict:

input
5
01100
10100
11000
00001
...

correct output
1

user output
2

Test 25

Verdict:

input
5
00010
00011
00001
11000
...

correct output
0

user output
2

Test 26

Verdict:

input
5
01010
10101
01010
10100
...

correct output
0

user output
1

Test 27

Verdict:

input
5
00010
00000
00000
10000
...

correct output
0

user output
2

Test 28

Verdict:

input
10
0111111110
1011000101
1100001110
1100101100
...

correct output
26

user output
4

Test 29

Verdict:

input
10
0011100010
0000000010
1001110011
1010001001
...

correct output
11

user output
2

Test 30

Verdict:

input
10
0000111000
0000001100
0000011111
0000001101
...

correct output
7

user output
2

Test 31

Verdict:

input
10
0101100111
1001000000
0000010000
1100100010
...

correct output
9

user output
4

Test 32

Verdict:

input
10
0111011111
1010010010
1101011001
1010101100
...

correct output
22

user output
4

Test 33

Verdict:

input
10
0001100110
0001010100
0001010111
1110000110
...

correct output
11

user output
3

Test 34

Verdict:

input
10
0110010000
1011011010
1100110110
0100101011
...

correct output
22

user output
2

Test 35

Verdict:

input
10
0001001101
0001010000
0000011110
1100000101
...

correct output
13

user output
2

Test 36

Verdict:

input
10
0101010110
1000101001
0001011011
1010101110
...

correct output
8

user output
3

Test 37

Verdict:

input
10
0001000000
0000100000
0000000010
1000110111
...

correct output
19

user output
2

Test 38

Verdict:

input
100
011111111011000101000111010110...

correct output
20807

user output
28

Test 39

Verdict:

input
100
001110001000000010111001100100...

correct output
21100

user output
23

Test 40

Verdict:

input
100
000011100000001100001111100110...

correct output
18556

user output
22

Test 41

Verdict:

input
100
010110011101000000001000010001...

correct output
20091

user output
22

Test 42

Verdict:

input
100
011101111110010010101100110110...

correct output
21281

user output
25

Test 43

Verdict:

input
100
000110011001010100101011100011...

correct output
20746

user output
26

Test 44

Verdict:

input
100
011001000011011010011011010101...

correct output
21793

user output
28

Test 45

Verdict:

input
100
000100110101010000001111000010...

correct output
19781

user output
21

Test 46

Verdict:

input
100
010101011000101001101101110111...

correct output
20006

user output
22

Test 47

Verdict:

input
100
000100000000100000000001011011...

correct output
19161

user output
25

Test 48

Verdict:

input
1000
011111111011000101000111010110...

correct output
20823418

user output
248

Test 49

Verdict:

input
1000
001110001000000010111001100100...

correct output
20848491

user output
255

Test 50

Verdict:

input
2000
010001011010001100000111100111...

correct output
166808034

user output
491

Test 51

Verdict:

input
2000
000010011000001011011110111110...

correct output
165842024

user output
503

Test 52

Verdict:

input
2999
000110011001010001100011110110...

correct output
561389670

user output
759

Test 53

Verdict:

input
3000
011111111111111111111111111111...

correct output
4495501000

user output
1500