| Task: | Connect cities |
| Sender: | aalto26bh_045 |
| Submission time: | 2026-09-03 19:19:24 +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 | ACCEPTED | 0.04 s | details |
| #4 | WRONG ANSWER | 0.04 s | details |
| #5 | WRONG ANSWER | 0.04 s | details |
| #6 | TIME LIMIT EXCEEDED | -- | details |
| #7 | TIME LIMIT EXCEEDED | -- | details |
| #8 | TIME LIMIT EXCEEDED | -- | details |
| #9 | TIME LIMIT EXCEEDED | -- | details |
| #10 | TIME LIMIT EXCEEDED | -- | details |
| #11 | TIME LIMIT EXCEEDED | -- | details |
| #12 | WRONG ANSWER | 0.04 s | details |
Code
x = input()
n = x.split(" ")[0]
m = x.split(" ")[1]
n = int(n)
m = int(m)
roads = []
for _ in range(m):
x = input()
roads.append([int(x.split(" ")[0]), int(x.split(" ")[1])])
buckets = []
for idx, road in enumerate(roads):
a = road[0]
b = road[1]
i = 0
while i < len(buckets):
bucket = buckets[i]
if a in bucket:
buckets[i].append(b)
j = i + 1
while j < len(buckets):
bucket_2 = buckets[j]
if b in bucket_2:
bucket[i] = bucket[i].extend(bucket_2)
buckets.remove(bucket_2)
break
j += 1
elif b in bucket:
buckets[i].append(a)
j = i + 1
while j < len(buckets):
bucket_2 = buckets[j]
if a in bucket_2:
bucket.extend(bucket_2)
buckets.remove(bucket_2)
break
j += 1
elif idx == len(roads) - 1:
buckets.append([a, b])
i += 1
if len(buckets) == 0:
buckets.append([a, b])
i = 1
while i <= n:
j = 0
while j < len(buckets):
if i in buckets[j]:
break
j += 1
if j == len(buckets):
if len(buckets) > 0:
buckets.append([buckets[0][0]])
else:
buckets.append([i])
i += 1
print(len(buckets) - 1)
i = 0
while i <= len(buckets) - 2:
bucket = buckets[i]
bucket_1 = buckets[i + 1]
print(f"{bucket[0]} {bucket_1[0]}")
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 |
|---|
| 4 2 2 2 2 2 2 2 2 |
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 |
|---|
| 2 3 3 3 3 |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 10 10 7 9 1 7 1 3 3 4 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 4
Verdict: WRONG ANSWER
| input |
|---|
| 10 10 4 8 5 9 4 9 2 7 ... |
| correct output |
|---|
| 1 1 3 |
| user output |
|---|
| 5 4 4 4 4 4 4 4 4 ... |
Test 5
Verdict: WRONG ANSWER
| input |
|---|
| 10 10 4 9 2 4 7 10 1 8 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| 3 4 6 6 4 4 4 |
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: TIME LIMIT EXCEEDED
| 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) |
Test 8
Verdict: TIME LIMIT EXCEEDED
| 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) |
Test 9
Verdict: TIME LIMIT EXCEEDED
| 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) |
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: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 1 1 2 |
| correct output |
|---|
| 99998 1 3 3 4 4 5 5 6 ... |
| user output |
|---|
| (empty) |
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 |
|---|
| 4 2 2 2 2 2 2 2 2 |
