| Task: | Download Speed |
| Sender: | banghalq |
| Submission time: | 2025-10-14 16:51:08 +0300 |
| Language: | Python3 (PyPy3) |
| Status: | READY |
| Result: | RUNTIME ERROR |
| test | verdict | time | |
|---|---|---|---|
| #1 | RUNTIME ERROR | 0.07 s | details |
| #2 | WRONG ANSWER | 0.04 s | details |
| #3 | RUNTIME ERROR | 0.07 s | details |
| #4 | ACCEPTED | 0.04 s | details |
| #5 | ACCEPTED | 0.09 s | details |
| #6 | RUNTIME ERROR | 0.09 s | details |
| #7 | RUNTIME ERROR | 0.10 s | details |
| #8 | WRONG ANSWER | 0.04 s | details |
| #9 | ACCEPTED | 0.04 s | details |
| #10 | WRONG ANSWER | 0.04 s | details |
| #11 | RUNTIME ERROR | 0.09 s | details |
| #12 | WRONG ANSWER | 0.04 s | details |
Code
n, m = [int(x) for x in input().split()]
matrice = {i:[] for i in range(n+1)}
threshold = 0
for _ in range(m):
a, b, c = [int(x) for x in input().split()]
i1 = len(matrice[a])
i2 = len(matrice[b])
matrice[a].append([b,c,i1])
matrice[b].append([a,0,i2])
threshold += c
def dfs(node, val=float('inf')):
if node == n:
return val
not_visited.remove(node)
for i, tupl in enumerate(matrice[node]):
next_node, poid, next_index = tupl
if poid >= threshold and next_node in not_visited:
res = dfs(next_node, min(val, poid))
if res > 0:
matrice[node][i][1] -= res
matrice[next_node][next_index][1] += res
return res
return 0
ans = 0
while threshold > 1:
while True:
not_visited = set(range(1,n+1))
res = dfs(1)
ans += res
if res == 0:
break
threshold /= 2
print(ans)
Test details
Test 1
Verdict: RUNTIME ERROR
| input |
|---|
| 4 3 1 2 5 2 3 3 3 4 6 |
| correct output |
|---|
| 3 |
| user output |
|---|
| (empty) |
Error:
Traceback (most recent call last):
File "input/code.py", line 31, in <module>
res = dfs(1)
File "input/code.py", line 20, in dfs
res = dfs(next_node, min(val, poid))
File "input/code.py", line 20, in dfs
res = dfs(next_node, min(val, poid))
File "input/code.py", line 23, in dfs
matrice[next_node][next_index][1] += res
IndexError: list index out of rangeTest 2
Verdict: WRONG ANSWER
| input |
|---|
| 4 5 1 2 1 1 3 1 2 3 1 2 4 1 ... |
| correct output |
|---|
| 2 |
| user output |
|---|
| 0 |
Test 3
Verdict: RUNTIME ERROR
| input |
|---|
| 4 5 1 2 1000000000 1 3 1000000000 2 3 1 2 4 1000000000 ... |
| correct output |
|---|
| 2000000000 |
| user output |
|---|
| (empty) |
Error:
Traceback (most recent call last):
File "input/code.py", line 31, in <module>
res = dfs(1)
File "input/code.py", line 20, in dfs
res = dfs(next_node, min(val, poid))
File "input/code.py", line 23, in dfs
matrice[next_node][next_index][1] += res
IndexError: list index out of rangeTest 4
Verdict: ACCEPTED
| input |
|---|
| 2 1 2 1 100 |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 2 1000 1 2 1000000000 1 2 1000000000 1 2 1000000000 1 2 1000000000 ... |
| correct output |
|---|
| 1000000000000 |
| user output |
|---|
| 1000000000000 |
Test 6
Verdict: RUNTIME ERROR
| input |
|---|
| 500 998 1 2 54 1 3 59 1 4 83 2 5 79 ... |
| correct output |
|---|
| 60 |
| user output |
|---|
| (empty) |
Error:
Traceback (most recent call last):
File "input/code.py", line 31, in <module>
res = dfs(1)
File "input/code.py", line 20, in dfs
res = dfs(next_node, min(val, poid))
File "input/code.py", line 20, in dfs
res = dfs(next_node, min(val, poid))
File "input/code.py", line 20, in dfs
res = dfs(next_node, min(val, poid))
[Previous line repeated 2 more times]
File "input/code.py", line 23, in dfs
matrice[next_node][next_index][1] += res
IndexError: list index out of rangeTest 7
Verdict: RUNTIME ERROR
| input |
|---|
| 500 998 1 2 530873053 1 3 156306296 1 4 478040476 3 5 303609600 ... |
| correct output |
|---|
| 1093765123 |
| user output |
|---|
| (empty) |
Error:
Traceback (most recent call last):
File "input/code.py", line 31, in <module>
res = dfs(1)
File "input/code.py", line 20, in dfs
res = dfs(next_node, min(val, poid))
File "input/code.py", line 20, in dfs
res = dfs(next_node, min(val, poid))
File "input/code.py", line 20, in dfs
res = dfs(next_node, min(val, poid))
[Previous line repeated 7 more times]
File "input/code.py", line 23, in dfs
matrice[next_node][next_index][1] += res
IndexError: list index out of rangeTest 8
Verdict: WRONG ANSWER
| input |
|---|
| 2 1 1 2 1 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 0 |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 4 5 1 2 3 2 4 2 1 3 4 3 4 5 ... |
| correct output |
|---|
| 6 |
| user output |
|---|
| 6 |
Test 10
Verdict: WRONG ANSWER
| input |
|---|
| 4 5 1 2 1 1 3 2 3 2 1 2 4 2 ... |
| correct output |
|---|
| 3 |
| user output |
|---|
| 0 |
Test 11
Verdict: RUNTIME ERROR
| input |
|---|
| 10 999 1 2 1000000000 1 2 1000000000 1 2 1000000000 1 2 1000000000 ... |
| correct output |
|---|
| 111000000000 |
| user output |
|---|
| (empty) |
Error:
Traceback (most recent call last):
File "input/code.py", line 31, in <module>
res = dfs(1)
File "input/code.py", line 20, in dfs
res = dfs(next_node, min(val, poid))
File "input/code.py", line 20, in dfs
res = dfs(next_node, min(val, poid))
File "input/code.py", line 20, in dfs
res = dfs(next_node, min(val, poid))
[Previous line repeated 5 more times]
File "input/code.py", line 23, in dfs
matrice[next_node][next_index][1] += res
IndexError: list index out of rangeTest 12
Verdict: WRONG ANSWER
| input |
|---|
| 7 9 1 2 1 1 3 1 1 4 1 2 5 1 ... |
| correct output |
|---|
| 2 |
| user output |
|---|
| 0 |