| Task: | Sadonkorjuu |
| Sender: | Lordoa |
| Submission time: | 2022-11-09 19:04:54 +0200 |
| Language: | Python3 (CPython3) |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.02 s | 1, 2 | details |
| #2 | ACCEPTED | 0.02 s | 1, 2 | details |
| #3 | ACCEPTED | 0.02 s | 1, 2 | details |
| #4 | ACCEPTED | 0.02 s | 1, 2 | details |
| #5 | WRONG ANSWER | 0.02 s | 1, 2 | details |
| #6 | ACCEPTED | 0.03 s | 1, 2 | details |
| #7 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #8 | WRONG ANSWER | 0.02 s | 1, 2 | details |
| #9 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #10 | WRONG ANSWER | 0.02 s | 1, 2 | details |
| #11 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #12 | RUNTIME ERROR | 0.98 s | 2 | details |
| #13 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #14 | WRONG ANSWER | 0.91 s | 2 | details |
| #15 | ACCEPTED | 0.24 s | 1, 2 | details |
| #16 | WRONG ANSWER | 0.03 s | 1, 2 | details |
| #17 | WRONG ANSWER | 0.02 s | 1, 2 | details |
| #18 | WRONG ANSWER | 0.03 s | 1, 2 | details |
| #19 | WRONG ANSWER | 0.02 s | 1, 2 | details |
| #20 | WRONG ANSWER | 0.02 s | 1, 2 | details |
| #21 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #22 | WRONG ANSWER | 0.92 s | 2 | details |
| #23 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #24 | WRONG ANSWER | 0.03 s | 1, 2 | details |
| #25 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #26 | ACCEPTED | 0.03 s | 1, 2 | details |
| #27 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #28 | ACCEPTED | 0.03 s | 1, 2 | details |
| #29 | TIME LIMIT EXCEEDED | -- | 2 | details |
| #30 | ACCEPTED | 0.03 s | 1, 2 | details |
| #31 | TIME LIMIT EXCEEDED | -- | 2 | details |
Code
n = int(input())
owo = [int(x) for x in input().split()]
uwu = {}
gps={}
for a in range(n):
uwu[a+1]=[]
gps[a+1]=None
for a in range(n-1):
rawr = [int(x) for x in input().split()]
uwu[rawr[0]].append((rawr[1],rawr[2]))
uwu[rawr[1]].append((rawr[0],rawr[2]))
#uwu = {1: [(2, 20), (4, 10)], 2: [(1, 20), (3, 30), (5, 50)], 3: [(2, 30), (6, 60)], 4: [(1, 10)], 5: [(2, 50)], 6: [(3, 60)]}
#!!! This doesn't take into account yet that it could be possible that the adjacent port isn't the closest one!!!
visited = set()
def route(city):
if gps[city]!=None:
return gps[city]
if owo[city-1]==0:
return 0
visited.add(city)
min = None
for paths in uwu[city]:
if paths[0] not in visited:
nuzzle = route(paths[0])
if paths[0] not in visited and (nuzzle is not None and (min is None or nuzzle<min)):
min = nuzzle+paths[1]
if len(visited)==1:
gps[city] = min
visited.remove(city)
return min
sum = 0
for a in range(n):
if owo[a]==1:
visited.clear()
wow = route(a+1)
sum += wow
print(sum)Test details
Test 1
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 1 0 |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 2
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 0 0 0 0 0 1 2 1 2 3 2 3 4 3 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 3
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 4 1 0 1 1 1 2 10 2 3 20 2 4 30 |
| correct output |
|---|
| 60 |
| user output |
|---|
| 60 |
Test 4
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 0 1 1 1 0 1 2 10 2 3 20 3 4 30 ... |
| correct output |
|---|
| 80 |
| user output |
|---|
| 80 |
Test 5
Group: 1, 2
Verdict: WRONG ANSWER
| input |
|---|
| 5 0 1 0 1 1 1 2 1 2 3 5 3 4 3 ... |
| correct output |
|---|
| 6 |
| user output |
|---|
| 10 |
Test 6
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 5506363 |
| user output |
|---|
| 5506363 |
Test 7
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 1795118520 |
| user output |
|---|
| (empty) |
Test 8
Group: 1, 2
Verdict: WRONG ANSWER
| input |
|---|
| 1000 0 0 1 0 1 1 0 1 0 1 1 0 0 0 1 ... |
| correct output |
|---|
| 293576 |
| user output |
|---|
| 343720 |
Test 9
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 816932444 |
| user output |
|---|
| (empty) |
Test 10
Group: 1, 2
Verdict: WRONG ANSWER
| input |
|---|
| 1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
| correct output |
|---|
| 3089 |
| user output |
|---|
| 4158 |
Test 11
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
| correct output |
|---|
| 40839 |
| user output |
|---|
| (empty) |
Test 12
Group: 2
Verdict: RUNTIME ERROR
| input |
|---|
| 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 5683983203973 |
| user output |
|---|
| (empty) |
Error:
Traceback (most recent call last):
File "/box/input/code.py", line 38, in <module>
w...Test 13
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 0 1 1 1 1 1 1 0 0 0 1 1 0 1 0 ... |
| correct output |
|---|
| 58572993 |
| user output |
|---|
| (empty) |
Test 14
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
| correct output |
|---|
| 32755 |
| user output |
|---|
| 47237 |
Test 15
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 126238345 |
| user output |
|---|
| 126238345 |
Test 16
Group: 1, 2
Verdict: WRONG ANSWER
| input |
|---|
| 1000 0 0 0 1 0 1 1 1 0 0 1 0 1 1 0 ... |
| correct output |
|---|
| 278678 |
| user output |
|---|
| 316901 |
Test 17
Group: 1, 2
Verdict: WRONG ANSWER
| input |
|---|
| 1000 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 ... |
| correct output |
|---|
| 34929 |
| user output |
|---|
| 50778 |
Test 18
Group: 1, 2
Verdict: WRONG ANSWER
| input |
|---|
| 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 1543963 |
| user output |
|---|
| 1585861 |
Test 19
Group: 1, 2
Verdict: WRONG ANSWER
| input |
|---|
| 1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
| correct output |
|---|
| 39606 |
| user output |
|---|
| 52120 |
Test 20
Group: 1, 2
Verdict: WRONG ANSWER
| input |
|---|
| 1000 1 0 1 0 1 0 0 0 0 1 1 0 0 0 1 ... |
| correct output |
|---|
| 321598 |
| user output |
|---|
| 370680 |
Test 21
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 978670626 |
| user output |
|---|
| (empty) |
Test 22
Group: 2
Verdict: WRONG ANSWER
| input |
|---|
| 200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
| correct output |
|---|
| 375218 |
| user output |
|---|
| 498027 |
Test 23
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 1 1 1 1 0 0 0 0 0 1 0 1 0 1 1 ... |
| correct output |
|---|
| 60422556 |
| user output |
|---|
| (empty) |
Test 24
Group: 1, 2
Verdict: WRONG ANSWER
| input |
|---|
| 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 291990 |
| user output |
|---|
| 421281 |
Test 25
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 59607954 |
| user output |
|---|
| (empty) |
Test 26
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 990 |
| user output |
|---|
| 990 |
Test 27
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 199982 |
| user output |
|---|
| (empty) |
Test 28
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 7987 |
| user output |
|---|
| 7987 |
Test 29
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 3137875 |
| user output |
|---|
| (empty) |
Test 30
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 4657693 |
| user output |
|---|
| 4657693 |
Test 31
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 200000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 1652889357 |
| user output |
|---|
| (empty) |
