Task: | Connect cities |
Sender: | clovis |
Submission time: | 2024-09-08 11:54:10 +0300 |
Language: | Python3 (CPython3) |
Status: | READY |
Result: | RUNTIME ERROR |
test | verdict | time | |
---|---|---|---|
#1 | RUNTIME ERROR | 0.02 s | details |
#2 | RUNTIME ERROR | 0.02 s | details |
#3 | RUNTIME ERROR | 0.02 s | details |
#4 | RUNTIME ERROR | 0.02 s | details |
#5 | RUNTIME ERROR | 0.02 s | details |
#6 | RUNTIME ERROR | 0.07 s | details |
#7 | RUNTIME ERROR | 0.07 s | details |
#8 | RUNTIME ERROR | 0.07 s | details |
#9 | RUNTIME ERROR | 0.07 s | details |
#10 | RUNTIME ERROR | 0.07 s | details |
#11 | RUNTIME ERROR | 0.02 s | details |
#12 | RUNTIME ERROR | 0.02 s | details |
Code
def findRoadsToBuild(cityMappingDict, n):graphs = []visited = set()for city in range(1, n + 1):if city not in visited:graph = []dfs(city, cityMappingDict, visited, graph)graphs.append(graph)roadsToBuildList = []for i in range(1, len(graphs)):roadsToBuildList.append((graphs[i - 1][0], graphs[i][0]))return roadsToBuildListdef dfs(city, cityMappingDict, visited, graph):stack = [city]visited.add(city)while stack:currCity = stack.pop()graph.append(currCity)for neighbour in cityMappingDict[currCity]:if neighbour not in visited:visited.add(neighbour)stack.append(neighbour)# first line, n (number of cities) and m (number of roads)import sysinput = sys.stdin.readnumCitiesNumRoadsInput = input().split()n = int(numCitiesNumRoadsInput[0])m = int(numCitiesNumRoadsInput[1])if n == 1:sys.stdout.write("0\n")elif n == 2 and m == 1:sys.stdout.write("0\n")else:# initialise dict to act as an adjacency listcityMappingDict = dict()# subsequent lines, roads connecting citiesfor i in range(m):cityRoadConnectionString = input().split()leftCity = int(cityRoadConnectionString[0])rightCity = int(cityRoadConnectionString[1])if leftCity not in cityMappingDict:cityMappingDict[leftCity] = []if rightCity not in cityMappingDict:cityMappingDict[rightCity] = []cityMappingDict[leftCity].append(rightCity)cityMappingDict[rightCity].append(leftCity)# fill in missing cities who don't have any roadsfor i in range(1, n + 1):if i not in cityMappingDict:cityMappingDict[i] = []# print(cityMappingDict)newRoads = findRoadsToBuild(cityMappingDict, n)sys.stdout.write(f"{len(newRoads)}\n")for newRoad in newRoads:sys.stdout.write(f"{newRoad[0]} {newRoad[1]}\n")
Test details
Test 1
Verdict: RUNTIME ERROR
input |
---|
10 10 2 5 5 6 1 4 6 8 ... |
correct output |
---|
2 1 2 2 7 |
user output |
---|
(empty) |
Error:
Traceback (most recent call last): File "/box/input/code.py", line 49, in <module> l...
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 |
---|
(empty) |
Error:
Traceback (most recent call last): File "/box/input/code.py", line 49, in <module> l...
Test 3
Verdict: RUNTIME ERROR
input |
---|
10 10 7 9 1 7 1 3 3 4 ... |
correct output |
---|
0 |
user output |
---|
(empty) |
Error:
Traceback (most recent call last): File "/box/input/code.py", line 49, in <module> l...
Test 4
Verdict: RUNTIME ERROR
input |
---|
10 10 4 8 5 9 4 9 2 7 ... |
correct output |
---|
1 1 3 |
user output |
---|
(empty) |
Error:
Traceback (most recent call last): File "/box/input/code.py", line 49, in <module> l...
Test 5
Verdict: RUNTIME ERROR
input |
---|
10 10 4 9 2 4 7 10 1 8 ... |
correct output |
---|
0 |
user output |
---|
(empty) |
Error:
Traceback (most recent call last): File "/box/input/code.py", line 49, in <module> l...
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 49, in <module> l...
Test 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 49, in <module> l...
Test 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 49, in <module> l...
Test 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 49, in <module> l...
Test 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 49, in <module> l...
Test 11
Verdict: RUNTIME ERROR
input |
---|
100000 1 1 2 |
correct output |
---|
99998 1 3 3 4 4 5 5 6 ... |
user output |
---|
(empty) |
Error:
Traceback (most recent call last): File "/box/input/code.py", line 49, in <module> l...
Test 12
Verdict: RUNTIME ERROR
input |
---|
10 9 2 5 5 6 1 4 6 8 ... |
correct output |
---|
2 1 2 2 7 |
user output |
---|
(empty) |
Error:
Traceback (most recent call last): File "/box/input/code.py", line 49, in <module> l...