Task: | Connect cities |
Sender: | casimir2004 |
Submission time: | 2024-09-08 12:22:38 +0300 |
Language: | Python3 (CPython3) |
Status: | READY |
Result: | WRONG ANSWER |
test | verdict | time | |
---|---|---|---|
#1 | WRONG ANSWER | 0.02 s | details |
#2 | RUNTIME ERROR | 0.02 s | details |
#3 | WRONG ANSWER | 0.02 s | details |
#4 | WRONG ANSWER | 0.02 s | details |
#5 | WRONG ANSWER | 0.02 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 | ACCEPTED | 0.41 s | details |
#12 | WRONG ANSWER | 0.02 s | details |
Code
from collections import Counter # O(n^2) solution, testing to see if it works n, m = map(int, input().split()) k = n-m-1 roads = [] for i in range(m): a,b = map(int, input().split()) roads.append(a) roads.append(b) li = [] for i in range(1, n+1): counter = 0 for j in range(len(roads)): if i == roads[j]: counter+=1 li.append([i, counter]) #print(li) results = [] for i in range(n): if i == 0: road = [] road.append(1) if li[0][1] == 0: for j in range(i+1, n): if li[j][1] < 2: li[0][1] = 1 li[j][1]+=1 road.append(j+1) break results.append(road) elif i!=n-1: road = [] if li[i][1] < 2: li[i][1]+=1 road.append(i+1) for j in range(i+1, n): if li[j][1] < 2: li[j][1]+=1 road.append(j+1) break results.append(road) print(k) for i in range(len(results)): print(str(results[i][0]) + " " + str(results[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 4 7 7 9 |
Test 2
Verdict: RUNTIME ERROR
input |
---|
10 10 3 9 6 8 9 10 7 8 ... |
correct output |
---|
2 1 4 4 5 |
user output |
---|
-1 2 3 4 5 |
Error:
Traceback (most recent call last): File "/box/input/code.py", line 59, in <module> p...
Test 3
Verdict: WRONG ANSWER
input |
---|
10 10 7 9 1 7 1 3 3 4 ... |
correct output |
---|
0 |
user output |
---|
-1 2 5 6 8 |
Test 4
Verdict: WRONG ANSWER
input |
---|
10 10 4 8 5 9 4 9 2 7 ... |
correct output |
---|
1 1 3 |
user output |
---|
-1 3 10 |
Test 5
Verdict: WRONG ANSWER
input |
---|
10 10 4 9 2 4 7 10 1 8 ... |
correct output |
---|
0 |
user output |
---|
-1 2 3 5 6 |
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: 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 ... 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 4 7 7 9 |