CSES - Aalto Competitive Programming 2024 - wk2 - Homework - Results
Submission details
Task:Connect cities
Sender:casimir2004
Submission time:2024-09-08 19:23:51 +0300
Language:CPython3
Status:READY
Result:
Test results
testverdicttime
#10.02 sdetails
#20.02 sdetails
#3ACCEPTED0.02 sdetails
#40.02 sdetails
#5ACCEPTED0.02 sdetails
#60.86 sdetails
#70.87 sdetails
#80.88 sdetails
#90.88 sdetails
#100.87 sdetails
#110.35 sdetails
#120.02 sdetails

Code

n, m = map(int, input().split())

g = {}
for i in range(1, n+1):
    g[i] = []

for i in range(m):
    a, b = map(int, input().split())
    g[a].append(b)
    g[b].append(a)

print("Graph:", g)

visited = [False] * (n + 1)

def dfs(node, visited, temp):
    visited[node] = True
    temp.append(node)
    for neighbor in g[node]:
        if not visited[neighbor]:
            dfs(neighbor, visited, temp)

connected_components = []

for i in range(1, n+1):
    if not visited[i]:
        temp = []
        dfs(i, visited, temp)  # Perform DFS
        connected_components.append(temp)

print("Connected Components:", connected_components)

k = len(connected_components)-1
print(k)
for i in range(k):
    print(str(connected_components[i][-1]) + " " + str(connected_components[i+1][0]))

Test details

Test 1

Verdict:

input
10 10
2 5
5 6
1 4
6 8
...

correct output
2
1 2
2 7

user output
Graph: {1: [4, 10], 2: [5, 6, ...

Test 2

Verdict:

input
10 10
3 9
6 8
9 10
7 8
...

correct output
2
1 4
4 5

user output
Graph: {1: [9], 2: [7], 3: [9]...

Test 3

Verdict: ACCEPTED

input
10 10
7 9
1 7
1 3
3 4
...

correct output
0

user output
Graph: {1: [7, 3], 2: [9], 3: ...

Test 4

Verdict:

input
10 10
4 8
5 9
4 9
2 7
...

correct output
1
1 3

user output
Graph: {1: [5], 2: [7, 4], 3: ...

Test 5

Verdict: ACCEPTED

input
10 10
4 9
2 4
7 10
1 8
...

correct output
0

user output
Graph: {1: [8, 5], 2: [4], 3: ...

Test 6

Verdict:

input
100000 200000
7233 22146
94937 96203
6133 10731
98737 99193
...

correct output
4785
1 2
2 3
3 4
4 5
...

user output
Graph: {1: [], 2: [7715, 60225...

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 28, in <module>
    dfs(i, visited, temp)  # Perform DFS
  File "/box/input/code.py", line 21, in dfs
    dfs(neighbor, visited, temp)
  File "/box/input/code.py", line 21, in dfs
    dfs(neighbor, visited, temp)
  File "/box/input/code.py", line 21, in dfs
    dfs(neighbor, visited, temp)
  [Previous line repeated 995 more times]
  File "/box/input/code.py", line 18, in dfs
    temp.append(node)
RecursionError: maximum recursion depth exceeded while calling a Python object

Test 7

Verdict:

input
100000 200000
92950 93575
24401 88897
41796 99364
47106 50330
...

correct output
4868
1 2
2 7
7 9
9 15
...

user output
Graph: {1: [], 2: [93165, 9245...

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 28, in <module>
    dfs(i, visited, temp)  # Perform DFS
  File "/box/input/code.py", line 21, in dfs
    dfs(neighbor, visited, temp)
  File "/box/input/code.py", line 21, in dfs
    dfs(neighbor, visited, temp)
  File "/box/input/code.py", line 21, in dfs
    dfs(neighbor, visited, temp)
  [Previous line repeated 995 more times]
  File "/box/input/code.py", line 18, in dfs
    temp.append(node)
RecursionError: maximum recursion depth exceeded while calling a Python object

Test 8

Verdict:

input
100000 200000
15637 76736
79169 98809
4382 86557
73383 77029
...

correct output
4683
1 9
9 20
20 27
27 28
...

user output
Graph: {1: [88823, 52592], 2: ...

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 28, in <module>
    dfs(i, visited, temp)  # Perform DFS
  File "/box/input/code.py", line 21, in dfs
    dfs(neighbor, visited, temp)
  File "/box/input/code.py", line 21, in dfs
    dfs(neighbor, visited, temp)
  File "/box/input/code.py", line 21, in dfs
    dfs(neighbor, visited, temp)
  [Previous line repeated 995 more times]
  File "/box/input/code.py", line 18, in dfs
    temp.append(node)
RecursionError: maximum recursion depth exceeded while calling a Python object

Test 9

Verdict:

input
100000 200000
47932 66981
86401 99942
4353 27841
60492 67345
...

correct output
4807
1 6
6 7
7 11
11 12
...

user output
Graph: {1: [66686], 2: [25754,...

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 28, in <module>
    dfs(i, visited, temp)  # Perform DFS
  File "/box/input/code.py", line 21, in dfs
    dfs(neighbor, visited, temp)
  File "/box/input/code.py", line 21, in dfs
    dfs(neighbor, visited, temp)
  File "/box/input/code.py", line 21, in dfs
    dfs(neighbor, visited, temp)
  [Previous line repeated 995 more times]
  File "/box/input/code.py", line 18, in dfs
    temp.append(node)
RecursionError: maximum recursion depth exceeded while calling a Python object

Test 10

Verdict:

input
100000 200000
6554 44548
76413 98555
5447 59589
70166 74434
...

correct output
4786
1 2
2 18
18 21
21 27
...

user output
Graph: {1: [33404, 46196, 4708...

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 28, in <module>
    dfs(i, visited, temp)  # Perform DFS
  File "/box/input/code.py", line 21, in dfs
    dfs(neighbor, visited, temp)
  File "/box/input/code.py", line 21, in dfs
    dfs(neighbor, visited, temp)
  File "/box/input/code.py", line 21, in dfs
    dfs(neighbor, visited, temp)
  [Previous line repeated 995 more times]
  File "/box/input/code.py", line 18, in dfs
    temp.append(node)
RecursionError: maximum recursion depth exceeded while calling a Python object

Test 11

Verdict:

input
100000 1
1 2

correct output
99998
1 3
3 4
4 5
5 6
...

user output
Graph: {1: [2], 2: [1], 3: [],...

Test 12

Verdict:

input
10 9
2 5
5 6
1 4
6 8
...

correct output
2
1 2
2 7

user output
Graph: {1: [4, 10], 2: [5, 6, ...