| Task: | Connect cities |
| Sender: | aalto26bh_009 |
| Submission time: | 2026-09-07 12:14:23 +0300 |
| Language: | Python3 (PyPy3) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.04 s | details |
| #2 | ACCEPTED | 0.04 s | details |
| #3 | ACCEPTED | 0.04 s | details |
| #4 | ACCEPTED | 0.04 s | details |
| #5 | ACCEPTED | 0.04 s | details |
| #6 | ACCEPTED | 0.42 s | details |
| #7 | ACCEPTED | 0.42 s | details |
| #8 | ACCEPTED | 0.42 s | details |
| #9 | ACCEPTED | 0.43 s | details |
| #10 | ACCEPTED | 0.43 s | details |
| #11 | ACCEPTED | 0.13 s | details |
| #12 | ACCEPTED | 0.04 s | details |
Code
def main():
cities, roads = [int(x) for x in input().split()]
adj_list = {k:[] for k in range(1, cities+1)}
visited = [False for _ in range(cities+1)]
new_roads = []
stack = []
for _ in range(roads):
city1,city2 = [int(x) for x in input().split()]
adj_list[city1].append(city2)
adj_list[city2].append(city1)
for city in adj_list:
if not visited[city]:
stack.append(city)
visited[city] = True
if city != 1:
new_roads.append([1, city])
while stack:
aux = stack.pop()
for x in adj_list[aux]:
if not visited[x]:
stack.append(x)
visited[x] = True
print(len(new_roads))
for x in new_roads:
print(f"{x[0]} {x[1]}")
main()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: ACCEPTED
| input |
|---|
| 100000 200000 7233 22146 94937 96203 6133 10731 98737 99193 ... |
| correct output |
|---|
| 4785 1 2 2 3 3 4 4 5 ... |
| user output |
|---|
| 4785 1 2 1 3 1 4 1 5 ... |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 100000 200000 92950 93575 24401 88897 41796 99364 47106 50330 ... |
| correct output |
|---|
| 4868 1 2 2 7 7 9 9 15 ... |
| user output |
|---|
| 4868 1 2 1 7 1 9 1 15 ... |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 100000 200000 15637 76736 79169 98809 4382 86557 73383 77029 ... |
| correct output |
|---|
| 4683 1 9 9 20 20 27 27 28 ... |
| user output |
|---|
| 4683 1 9 1 20 1 27 1 28 ... |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 100000 200000 47932 66981 86401 99942 4353 27841 60492 67345 ... |
| correct output |
|---|
| 4807 1 6 6 7 7 11 11 12 ... |
| user output |
|---|
| 4807 1 6 1 7 1 11 1 12 ... |
Test 10
Verdict: ACCEPTED
| input |
|---|
| 100000 200000 6554 44548 76413 98555 5447 59589 70166 74434 ... |
| correct output |
|---|
| 4786 1 2 2 18 18 21 21 27 ... |
| user output |
|---|
| 4786 1 2 1 18 1 21 1 27 ... |
Test 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 |
