CSES - Aalto Competitive Programming 2024 - wk8 - Mon - Results
Submission details
Task:Illuminati
Sender:Farah
Submission time:2024-10-28 17:15:08 +0200
Language:Python3 (PyPy3)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.04 sdetails
#2ACCEPTED0.04 sdetails
#3ACCEPTED0.04 sdetails
#40.04 sdetails
#5ACCEPTED0.04 sdetails
#6ACCEPTED0.04 sdetails
#7ACCEPTED0.04 sdetails
#80.04 sdetails
#9ACCEPTED0.04 sdetails
#100.04 sdetails
#11ACCEPTED0.04 sdetails
#120.04 sdetails
#13ACCEPTED0.04 sdetails
#14ACCEPTED0.04 sdetails
#15ACCEPTED0.04 sdetails
#160.04 sdetails
#17ACCEPTED0.04 sdetails
#180.04 sdetails
#190.04 sdetails
#20ACCEPTED0.04 sdetails
#210.04 sdetails
#220.04 sdetails
#23ACCEPTED0.04 sdetails
#240.04 sdetails
#25ACCEPTED0.04 sdetails
#26ACCEPTED0.04 sdetails
#27ACCEPTED0.04 sdetails
#280.04 sdetails
#290.04 sdetails
#300.04 sdetails
#310.04 sdetails
#320.04 sdetails
#330.04 sdetails
#340.04 sdetails
#350.04 sdetails
#360.04 sdetails
#370.04 sdetails
#380.06 sdetails
#390.06 sdetails
#400.06 sdetails
#410.06 sdetails
#420.06 sdetails
#430.06 sdetails
#440.06 sdetails
#450.06 sdetails
#460.06 sdetails
#470.06 sdetails
#48--details
#49--details
#50--details
#51--details
#52--details
#531.25 sdetails

Code

def count_triangles(n, adjacency_matrix):
    triangle_count = 0
    adjacency_list = [set() for _ in range(n)]
    
    for i in range(n):
        for j in range(n):
            if adjacency_matrix[i][j] == 1:
                adjacency_list[i].add(j)

    for i in range(n):
        for j in range(i + 1, n):
            if adjacency_matrix[i][j]:
                common_neighbors = adjacency_list[i].intersection(adjacency_list[j])
                triangle_count += len(common_neighbors)

    return triangle_count

def main():
    import sys
    input = sys.stdin.read
    data = input().splitlines()

    n = int(data[0].strip())
    adjacency_matrix = []
    
    for i in range(1, n + 1):
        row = list(map(int, data[i].strip()))
        adjacency_matrix.append(row)

    result = count_triangles(n, adjacency_matrix)
    print(result)

if __name__ == "__main__":
    main()

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
3

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
12

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
3

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
6

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
3

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
21

Test 19

Verdict:

input
5
00111
00000
10010
10100
...

correct output
1

user output
3

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
3

Test 22

Verdict:

input
5
01110
10111
11011
11101
...

correct output
7

user output
21

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
3

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
78

Test 29

Verdict:

input
10
0011100010
0000000010
1001110011
1010001001
...

correct output
11

user output
33

Test 30

Verdict:

input
10
0000111000
0000001100
0000011111
0000001101
...

correct output
7

user output
21

Test 31

Verdict:

input
10
0101100111
1001000000
0000010000
1100100010
...

correct output
9

user output
27

Test 32

Verdict:

input
10
0111011111
1010010010
1101011001
1010101100
...

correct output
22

user output
66

Test 33

Verdict:

input
10
0001100110
0001010100
0001010111
1110000110
...

correct output
11

user output
33

Test 34

Verdict:

input
10
0110010000
1011011010
1100110110
0100101011
...

correct output
22

user output
66

Test 35

Verdict:

input
10
0001001101
0001010000
0000011110
1100000101
...

correct output
13

user output
39

Test 36

Verdict:

input
10
0101010110
1000101001
0001011011
1010101110
...

correct output
8

user output
24

Test 37

Verdict:

input
10
0001000000
0000100000
0000000010
1000110111
...

correct output
19

user output
57

Test 38

Verdict:

input
100
011111111011000101000111010110...

correct output
20807

user output
62421

Test 39

Verdict:

input
100
001110001000000010111001100100...

correct output
21100

user output
63300

Test 40

Verdict:

input
100
000011100000001100001111100110...

correct output
18556

user output
55668

Test 41

Verdict:

input
100
010110011101000000001000010001...

correct output
20091

user output
60273

Test 42

Verdict:

input
100
011101111110010010101100110110...

correct output
21281

user output
63843

Test 43

Verdict:

input
100
000110011001010100101011100011...

correct output
20746

user output
62238

Test 44

Verdict:

input
100
011001000011011010011011010101...

correct output
21793

user output
65379

Test 45

Verdict:

input
100
000100110101010000001111000010...

correct output
19781

user output
59343

Test 46

Verdict:

input
100
010101011000101001101101110111...

correct output
20006

user output
60018

Test 47

Verdict:

input
100
000100000000100000000001011011...

correct output
19161

user output
57483

Test 48

Verdict:

input
1000
011111111011000101000111010110...

correct output
20823418

user output
(empty)

Test 49

Verdict:

input
1000
001110001000000010111001100100...

correct output
20848491

user output
(empty)

Test 50

Verdict:

input
2000
010001011010001100000111100111...

correct output
166808034

user output
(empty)

Test 51

Verdict:

input
2000
000010011000001011011110111110...

correct output
165842024

user output
(empty)

Test 52

Verdict:

input
2999
000110011001010001100011110110...

correct output
561389670

user output
(empty)

Test 53

Verdict:

input
3000
011111111111111111111111111111...

correct output
4495501000

user output
(empty)