| Task: | Connect cities |
| Sender: | zilakkio |
| Submission time: | 2024-09-05 21:26:07 +0300 |
| Language: | CPython3 |
| Status: | READY |
| Result: | RUNTIME ERROR |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.02 s | details |
| #2 | ACCEPTED | 0.02 s | details |
| #3 | ACCEPTED | 0.02 s | details |
| #4 | ACCEPTED | 0.02 s | details |
| #5 | ACCEPTED | 0.02 s | details |
| #6 | RUNTIME ERROR | 0.69 s | details |
| #7 | RUNTIME ERROR | 0.70 s | details |
| #8 | RUNTIME ERROR | 0.69 s | details |
| #9 | RUNTIME ERROR | 0.71 s | details |
| #10 | RUNTIME ERROR | 0.70 s | details |
| #11 | ACCEPTED | 0.27 s | details |
| #12 | ACCEPTED | 0.02 s | details |
Code
n, m = map(int, input().split())
adj = [[] for _ in range(n)]
for _ in range(m):
a, b = map(int, input().split())
adj[a - 1].append(b - 1)
adj[b - 1].append(a - 1)
components = []
visited = [False for _ in range(n)]
comp = []
def dfs(s):
if visited[s]:
return
visited[s] = True
comp.append(s)
for u in adj[s]:
dfs(u)
for i in range(n):
if not visited[i]:
comp = []
dfs(i)
components.append(comp)
print(len(components) - 1)
for i in range(1, len(components)):
print(components[i - 1][-1] + 1, components[i][0] + 1)
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 10 2 3 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 2 4 4 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 10 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 26, in <module>
dfs(i)
File "/box/input/code.py", line 20, in dfs
dfs(u)
File "/box/input/code.py", line 20, in dfs
dfs(u)
File "/box/input/code.py", line 20, in dfs
dfs(u)
[Previous line repeated 995 more times]
File "/box/input/code.py", line 18, in dfs
comp.append(s)
RecursionError: maximum recursion depth exceeded while calling a Python objectTest 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 26, in <module>
dfs(i)
File "/box/input/code.py", line 20, in dfs
dfs(u)
File "/box/input/code.py", line 20, in dfs
dfs(u)
File "/box/input/code.py", line 20, in dfs
dfs(u)
[Previous line repeated 995 more times]
File "/box/input/code.py", line 18, in dfs
comp.append(s)
RecursionError: maximum recursion depth exceeded while calling a Python objectTest 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 26, in <module>
dfs(i)
File "/box/input/code.py", line 20, in dfs
dfs(u)
File "/box/input/code.py", line 20, in dfs
dfs(u)
File "/box/input/code.py", line 20, in dfs
dfs(u)
[Previous line repeated 995 more times]
File "/box/input/code.py", line 18, in dfs
comp.append(s)
RecursionError: maximum recursion depth exceeded while calling a Python objectTest 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 26, in <module>
dfs(i)
File "/box/input/code.py", line 20, in dfs
dfs(u)
File "/box/input/code.py", line 20, in dfs
dfs(u)
File "/box/input/code.py", line 20, in dfs
dfs(u)
[Previous line repeated 995 more times]
File "/box/input/code.py", line 18, in dfs
comp.append(s)
RecursionError: maximum recursion depth exceeded while calling a Python objectTest 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 26, in <module>
dfs(i)
File "/box/input/code.py", line 20, in dfs
dfs(u)
File "/box/input/code.py", line 20, in dfs
dfs(u)
File "/box/input/code.py", line 20, in dfs
dfs(u)
[Previous line repeated 995 more times]
File "/box/input/code.py", line 18, in dfs
comp.append(s)
RecursionError: maximum recursion depth exceeded while calling a Python objectTest 11
Verdict: ACCEPTED
| input |
|---|
| 100000 1 1 2 |
| correct output |
|---|
| 99998 1 3 3 4 4 5 5 6 ... |
| user output |
|---|
| 99998 2 3 3 4 4 5 5 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 10 2 3 7 |