| Task: | Connect cities |
| Sender: | aalto26bh_048 |
| Submission time: | 2026-09-04 23:47:30 +0300 |
| Language: | Python3 (PyPy3) |
| Status: | READY |
| Result: | RUNTIME ERROR |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.04 s | details |
| #2 | ACCEPTED | 0.04 s | details |
| #3 | ACCEPTED | 0.04 s | details |
| #4 | ACCEPTED | 0.05 s | details |
| #5 | ACCEPTED | 0.04 s | details |
| #6 | RUNTIME ERROR | 0.39 s | details |
| #7 | RUNTIME ERROR | 0.39 s | details |
| #8 | RUNTIME ERROR | 0.39 s | details |
| #9 | RUNTIME ERROR | 0.39 s | details |
| #10 | RUNTIME ERROR | 0.39 s | details |
| #11 | ACCEPTED | 0.14 s | details |
| #12 | ACCEPTED | 0.04 s | details |
Code
from collections import defaultdict
if __name__ == "__main__":
n, m = [int(x) for x in input().split(" ")]
roads = defaultdict(list)
for x in range(1, m + 1):
s, e = [int(x) for x in input().split(" ")]
roads[s].append(e)
roads[e].append(s)
visited = {}
new_roads = []
def dfs(x):
if x in visited:
return
visited[x] = True
for n in roads[x]:
dfs(n)
for x in range(1, n + 1):
if x in visited:
continue
new_roads.append(x)
dfs(x)
print(len(new_roads) - 1)
for e in new_roads[1:]:
print(1, e)Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 10 10 2 5 5 6 1 4 6 8 ... |
| correct output |
|---|
| 2 1 2 2 7 |
| user output |
|---|
| 2 1 2 1 7 |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 10 10 3 9 6 8 9 10 7 8 ... |
| correct output |
|---|
| 2 1 4 4 5 |
| user output |
|---|
| 2 1 4 1 5 |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 10 10 7 9 1 7 1 3 3 4 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 10 10 4 8 5 9 4 9 2 7 ... |
| correct output |
|---|
| 1 1 3 |
| user output |
|---|
| 1 1 3 |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 10 10 4 9 2 4 7 10 1 8 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 6
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 200000 7233 22146 94937 96203 6133 10731 98737 99193 ... |
| correct output |
|---|
| 4785 1 2 2 3 3 4 4 5 ... |
| user output |
|---|
| (empty) |
Error:
Traceback (most recent call last):
File "/box/input/code.py", line 27, in <module>
dfs(x)
File "/box/input/code.py", line 21, in dfs
dfs(n)
File "/box/input/code.py", line 21, in dfs
dfs(n)
File "/box/input/code.py", line 21, in dfs
dfs(n)
[Previous line repeated 1538 more times]
File "/box/input/code.py", line 16, in dfs
def dfs(x):
RecursionError: maximum recursion depth exceededTest 7
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 200000 92950 93575 24401 88897 41796 99364 47106 50330 ... |
| correct output |
|---|
| 4868 1 2 2 7 7 9 9 15 ... |
| user output |
|---|
| (empty) |
Error:
Traceback (most recent call last):
File "/box/input/code.py", line 27, in <module>
dfs(x)
File "/box/input/code.py", line 21, in dfs
dfs(n)
File "/box/input/code.py", line 21, in dfs
dfs(n)
File "/box/input/code.py", line 21, in dfs
dfs(n)
[Previous line repeated 1684 more times]
File "/box/input/code.py", line 20, in dfs
for n in roads[x]:
RecursionError: maximum recursion depth exceededTest 8
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 200000 15637 76736 79169 98809 4382 86557 73383 77029 ... |
| correct output |
|---|
| 4683 1 9 9 20 20 27 27 28 ... |
| user output |
|---|
| (empty) |
Error:
Traceback (most recent call last):
File "/box/input/code.py", line 27, in <module>
dfs(x)
File "/box/input/code.py", line 21, in dfs
dfs(n)
File "/box/input/code.py", line 21, in dfs
dfs(n)
File "/box/input/code.py", line 21, in dfs
dfs(n)
[Previous line repeated 1492 more times]
RecursionError: maximum recursion depth exceededTest 9
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 200000 47932 66981 86401 99942 4353 27841 60492 67345 ... |
| correct output |
|---|
| 4807 1 6 6 7 7 11 11 12 ... |
| user output |
|---|
| (empty) |
Error:
Traceback (most recent call last):
File "/box/input/code.py", line 27, in <module>
dfs(x)
File "/box/input/code.py", line 21, in dfs
dfs(n)
File "/box/input/code.py", line 21, in dfs
dfs(n)
File "/box/input/code.py", line 21, in dfs
dfs(n)
[Previous line repeated 1684 more times]
File "/box/input/code.py", line 20, in dfs
for n in roads[x]:
RecursionError: maximum recursion depth exceededTest 10
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 200000 6554 44548 76413 98555 5447 59589 70166 74434 ... |
| correct output |
|---|
| 4786 1 2 2 18 18 21 21 27 ... |
| user output |
|---|
| (empty) |
Error:
Traceback (most recent call last):
File "/box/input/code.py", line 27, in <module>
dfs(x)
File "/box/input/code.py", line 21, in dfs
dfs(n)
File "/box/input/code.py", line 21, in dfs
dfs(n)
File "/box/input/code.py", line 21, in dfs
dfs(n)
[Previous line repeated 1684 more times]
File "/box/input/code.py", line 20, in dfs
for n in roads[x]:
RecursionError: maximum recursion depth exceededTest 11
Verdict: ACCEPTED
| input |
|---|
| 100000 1 1 2 |
| correct output |
|---|
| 99998 1 3 3 4 4 5 5 6 ... |
| user output |
|---|
| 99998 1 3 1 4 1 5 1 6 ... |
Test 12
Verdict: ACCEPTED
| input |
|---|
| 10 9 2 5 5 6 1 4 6 8 ... |
| correct output |
|---|
| 2 1 2 2 7 |
| user output |
|---|
| 2 1 2 1 7 |
