| Task: | Connect cities |
| Sender: | luukwin |
| Submission time: | 2025-09-04 12:14:10 +0300 |
| Language: | Python3 (PyPy3) |
| Status: | READY |
| Result: | WRONG ANSWER |
| test | verdict | time | |
|---|---|---|---|
| #1 | WRONG ANSWER | 0.04 s | details |
| #2 | WRONG ANSWER | 0.04 s | details |
| #3 | WRONG ANSWER | 0.04 s | details |
| #4 | WRONG ANSWER | 0.05 s | details |
| #5 | WRONG ANSWER | 0.04 s | details |
| #6 | TIME LIMIT EXCEEDED | -- | details |
| #7 | WRONG ANSWER | 0.67 s | details |
| #8 | WRONG ANSWER | 0.67 s | details |
| #9 | WRONG ANSWER | 0.68 s | details |
| #10 | TIME LIMIT EXCEEDED | -- | details |
| #11 | ACCEPTED | 0.12 s | details |
| #12 | WRONG ANSWER | 0.04 s | details |
Code
import sys
sys.setrecursionlimit(2*10**5)
numberofcities, numberofroads = [int(x) for x in input().split()]
roads = [[] for _ in range(numberofcities)]
visited = [False] * numberofcities
components = []
for i in range(numberofroads):
fullinput = [int(x) for x in input().split()]
roads[fullinput[0] - 1].append(fullinput[1] - 1)
roads[fullinput[1] - 1].append(fullinput[0] - 1)
print(numberofcities - 1 - numberofroads)
def findConnections(node):
visited[node] = True
for nei in roads[node]:
if not visited[nei]:
findConnections(nei)
for i in range(numberofcities):
if not visited[i]:
components.append(i)
findConnections(i)
for i in range(1, len(components)):
print(components[i-1] + 1, components[i] + 1)Test details
Test 1
Verdict: WRONG ANSWER
| input |
|---|
| 10 10 2 5 5 6 1 4 6 8 ... |
| correct output |
|---|
| 2 1 2 2 7 |
| user output |
|---|
| -1 1 2 2 7 |
Test 2
Verdict: WRONG ANSWER
| input |
|---|
| 10 10 3 9 6 8 9 10 7 8 ... |
| correct output |
|---|
| 2 1 4 4 5 |
| user output |
|---|
| -1 1 4 4 5 |
Test 3
Verdict: WRONG ANSWER
| input |
|---|
| 10 10 7 9 1 7 1 3 3 4 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| -1 |
Test 4
Verdict: WRONG ANSWER
| input |
|---|
| 10 10 4 8 5 9 4 9 2 7 ... |
| correct output |
|---|
| 1 1 3 |
| user output |
|---|
| -1 1 3 |
Test 5
Verdict: WRONG ANSWER
| input |
|---|
| 10 10 4 9 2 4 7 10 1 8 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| -1 |
Test 6
Verdict: TIME LIMIT EXCEEDED
| 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) |
Test 7
Verdict: WRONG ANSWER
| input |
|---|
| 100000 200000 92950 93575 24401 88897 41796 99364 47106 50330 ... |
| correct output |
|---|
| 4868 1 2 2 7 7 9 9 15 ... |
| user output |
|---|
| -100001 1 2 2 7 7 9 9 15 ... Truncated |
Test 8
Verdict: WRONG ANSWER
| input |
|---|
| 100000 200000 15637 76736 79169 98809 4382 86557 73383 77029 ... |
| correct output |
|---|
| 4683 1 9 9 20 20 27 27 28 ... |
| user output |
|---|
| -100001 1 9 9 20 20 27 27 28 ... Truncated |
Test 9
Verdict: WRONG ANSWER
| input |
|---|
| 100000 200000 47932 66981 86401 99942 4353 27841 60492 67345 ... |
| correct output |
|---|
| 4807 1 6 6 7 7 11 11 12 ... |
| user output |
|---|
| -100001 1 6 6 7 7 11 11 12 ... Truncated |
Test 10
Verdict: TIME LIMIT EXCEEDED
| 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) |
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 3 4 4 5 5 6 ... Truncated |
Test 12
Verdict: WRONG ANSWER
| input |
|---|
| 10 9 2 5 5 6 1 4 6 8 ... |
| correct output |
|---|
| 2 1 2 2 7 |
| user output |
|---|
| 0 1 2 2 7 |
