— Dark mode

Aalto Competitive Programming 2024 - wk2 - Homework

Connect cities

  • Start: 2024-09-04 12:00:00
  • End: 2024-09-12 12:00:00
CSES - Aalto Competitive Programming 2024 - wk2 - Homework - Results
Submission details
Task:Connect cities
Sender:odanobunaga8199
Submission time:2024-09-09 12:06:28 +0300
Language:CPython3
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.02 sdetails
#2ACCEPTED0.02 sdetails
#3ACCEPTED0.02 sdetails
#4ACCEPTED0.02 sdetails
#5ACCEPTED0.02 sdetails
#60.67 sdetails
#70.67 sdetails
#80.67 sdetails
#90.67 sdetails
#100.66 sdetails
#11ACCEPTED0.16 sdetails
#12ACCEPTED0.02 sdetails

Code

def find_minimum_roads(n, m, roads):
    adj = [[] for _ in range(n + 1)]
    for a, b in roads:
        adj[a].append(b)
        adj[b].append(a)
    visited = [False] * (n + 1)
    
    def dfs(city):
        visited[city] = True
        for neighbor in adj[city]:
            if not visited[neighbor]:
                dfs(neighbor)
    components = []
    for city in range(1, n + 1):
        if not visited[city]:
            components.append(city)
            dfs(city)
    if len(components) == 1:
        print(0)
        return
    
    print(len(components) - 1)
    
    for i in range(1, len(components)):
        print(components[i - 1], components[i])

n, m = map(int, input().split())
roads = [tuple(map(int, input().split())) for _ in range(m)]

# Finding and printing the result
find_minimum_roads(n, m, roads)

Test details

Test 1

Verdict: ACCEPTED

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

correct output
2
1 2
2 7
view save

user output
2
1 2
2 7
view save

Test 2

Verdict: ACCEPTED

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

correct output
2
1 4
4 5
view save

user output
2
1 4
4 5
view save

Test 3

Verdict: ACCEPTED

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

correct output
0
view save

user output
0
view save

Test 4

Verdict: ACCEPTED

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

correct output
1
1 3
view save

user output
1
1 3
view save

Test 5

Verdict: ACCEPTED

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

correct output
0
view save

user output
0
view save

Test 6

Verdict:

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

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

user output
(empty)

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 31, in <module>
    find_minimum_roads(n, m, roads)
  File "/box/input/code.py", line 17, in find_minimum_roads
    dfs(city)
  File "/box/input/code.py", line 12, in dfs
    dfs(neighbor)
  File "/box/input/code.py", line 12, in dfs
    dfs(neighbor)
  File "/box/input/code.py", line 12, in dfs
    dfs(neighbor)
  [Previous line repeated 995 more times]
RecursionError: maximum recursion depth exceeded

Test 7

Verdict:

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

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

user output
(empty)

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 31, in <module>
    find_minimum_roads(n, m, roads)
  File "/box/input/code.py", line 17, in find_minimum_roads
    dfs(city)
  File "/box/input/code.py", line 12, in dfs
    dfs(neighbor)
  File "/box/input/code.py", line 12, in dfs
    dfs(neighbor)
  File "/box/input/code.py", line 12, in dfs
    dfs(neighbor)
  [Previous line repeated 995 more times]
RecursionError: maximum recursion depth exceeded

Test 8

Verdict:

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

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

user output
(empty)

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 31, in <module>
    find_minimum_roads(n, m, roads)
  File "/box/input/code.py", line 17, in find_minimum_roads
    dfs(city)
  File "/box/input/code.py", line 12, in dfs
    dfs(neighbor)
  File "/box/input/code.py", line 12, in dfs
    dfs(neighbor)
  File "/box/input/code.py", line 12, in dfs
    dfs(neighbor)
  [Previous line repeated 995 more times]
RecursionError: maximum recursion depth exceeded

Test 9

Verdict:

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

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

user output
(empty)

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 31, in <module>
    find_minimum_roads(n, m, roads)
  File "/box/input/code.py", line 17, in find_minimum_roads
    dfs(city)
  File "/box/input/code.py", line 12, in dfs
    dfs(neighbor)
  File "/box/input/code.py", line 12, in dfs
    dfs(neighbor)
  File "/box/input/code.py", line 12, in dfs
    dfs(neighbor)
  [Previous line repeated 995 more times]
RecursionError: maximum recursion depth exceeded

Test 10

Verdict:

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

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

user output
(empty)

Error:
Traceback (most recent call last):
  File "/box/input/code.py", line 31, in <module>
    find_minimum_roads(n, m, roads)
  File "/box/input/code.py", line 17, in find_minimum_roads
    dfs(city)
  File "/box/input/code.py", line 12, in dfs
    dfs(neighbor)
  File "/box/input/code.py", line 12, in dfs
    dfs(neighbor)
  File "/box/input/code.py", line 12, in dfs
    dfs(neighbor)
  [Previous line repeated 995 more times]
RecursionError: maximum recursion depth exceeded

Test 11

Verdict: ACCEPTED

input
100000 1
1 2
view save

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

user output
99998
1 3
3 4
4 5
5 6
...
view save

Test 12

Verdict: ACCEPTED

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

correct output
2
1 2
2 7
view save

user output
2
1 2
2 7
view save

Tasks

A Connect citiesB Apartments

Submissions (odanobunaga8199)

2024-09-09 12:16:18 2024-09-09 12:06:28