| Task: | Lukuvälit |
| Sender: | CursedTomb |
| Submission time: | 2019-10-13 22:49:28 +0300 |
| Language: | Python3 (PyPy3) |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.05 s | 1, 2, 3 | details |
| #2 | RUNTIME ERROR | 0.07 s | 1, 2, 3 | details |
| #3 | RUNTIME ERROR | 0.07 s | 1, 2, 3 | details |
| #4 | WRONG ANSWER | 0.05 s | 1, 2, 3 | details |
| #5 | WRONG ANSWER | 0.05 s | 1, 2, 3 | details |
| #6 | WRONG ANSWER | 0.05 s | 1, 2, 3 | details |
| #7 | WRONG ANSWER | 0.05 s | 1, 2, 3 | details |
| #8 | WRONG ANSWER | 0.05 s | 1, 2, 3 | details |
| #9 | WRONG ANSWER | 0.05 s | 1, 2, 3 | details |
| #10 | WRONG ANSWER | 0.05 s | 1, 2, 3 | details |
| #11 | WRONG ANSWER | 0.05 s | 1, 2, 3 | details |
| #12 | RUNTIME ERROR | 0.07 s | 1, 2, 3 | details |
| #13 | WRONG ANSWER | 0.05 s | 2, 3 | details |
| #14 | WRONG ANSWER | 0.05 s | 2, 3 | details |
| #15 | WRONG ANSWER | 0.05 s | 2, 3 | details |
| #16 | WRONG ANSWER | 0.05 s | 2, 3 | details |
| #17 | WRONG ANSWER | 0.05 s | 2, 3 | details |
| #18 | WRONG ANSWER | 0.05 s | 2, 3 | details |
| #19 | WRONG ANSWER | 0.05 s | 2, 3 | details |
| #20 | RUNTIME ERROR | 0.07 s | 2, 3 | details |
| #21 | WRONG ANSWER | 0.05 s | 3 | details |
| #22 | WRONG ANSWER | 0.05 s | 3 | details |
| #23 | WRONG ANSWER | 0.05 s | 3 | details |
| #24 | WRONG ANSWER | 0.05 s | 3 | details |
| #25 | WRONG ANSWER | 0.05 s | 3 | details |
| #26 | WRONG ANSWER | 0.05 s | 3 | details |
| #27 | WRONG ANSWER | 0.05 s | 3 | details |
| #28 | RUNTIME ERROR | 0.08 s | 3 | details |
Code
import heapq as hq
import math
def dijkstra(G, s):
n = len(G)
visited = [False]*n
weights = [math.inf]*n
path = [None]*n
queue = []
weights[s] = 0
hq.heappush(queue, (0, s))
while len(queue) > 0:
g, u = hq.heappop(queue)
visited[u] = True
for v, w in G[u]:
if v >= len(visited): continue
if not visited[v]:
f = g + w
if f < weights[v]:
weights[v] = f
path[v] = u
hq.heappush(queue, (f, v))
return path, weights
x = input()
#distance = [4, 2, 2, 4, 5, 2, 2, 2, 2, 5, 2, 3]
distance = list(map(int, input().strip().split()))
#cost = [0, 2, 2, 3, 6, 5, 5, 5, 5, 1, 2, 3]
cost = []
cost.append(0)
a = list(map(int, input().strip().split()))
for i in a:
cost.append(int(i))
G = []
for i in range(len(distance)):
G.append([])
for connections in range(i+1, i+int(distance[i])+1):
if connections > len(distance):
break
G[i].append((connections, cost[i]))
G.append([])
G[len(distance)].append((len(distance)+1, 0))
#print(G)
path, cost = dijkstra(G, 0)
#print (path, cost)
print(cost[-1])
Test details
Test 1
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 4 0 10 1 5 3 4 11 11 |
| correct output |
|---|
| 3 1 0 1 |
| user output |
|---|
| inf |
Test 2
Group: 1, 2, 3
Verdict: RUNTIME ERROR
| input |
|---|
| 1 0 0 |
| correct output |
|---|
| 1 |
| user output |
|---|
| (empty) |
Error:
Traceback (most recent call last):
File "input/code.py", line 30, in <module>
a = li...Test 3
Group: 1, 2, 3
Verdict: RUNTIME ERROR
| input |
|---|
| 1 1000 1000 |
| correct output |
|---|
| 1 |
| user output |
|---|
| (empty) |
Error:
Traceback (most recent call last):
File "input/code.py", line 30, in <module>
a = li...Test 4
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 16 0 0 0 1 0 2 1 1 ... |
| correct output |
|---|
| 1 2 2 1 1 ... |
| user output |
|---|
| inf |
Test 5
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 9 0 0 0 1 0 10 0 11 ... |
| correct output |
|---|
| 1 2 3 4 5 ... |
| user output |
|---|
| inf |
Test 6
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1000 0 1000 0 1000 0 1000 0 1000 ... |
| correct output |
|---|
| 9 9 9 9 9 ... |
| user output |
|---|
| inf |
Test 7
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1000 100 111 0 101 1 10 10 110 ... |
| correct output |
|---|
| 4 6 2 5 8 ... |
| user output |
|---|
| 0 |
Test 8
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1000 480 564 753 988 479 909 32 973 ... |
| correct output |
|---|
| 0 0 0 4 0 ... |
| user output |
|---|
| 0 |
Test 9
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1000 98 111 8 111 98 111 111 113 ... |
| correct output |
|---|
| 4 6 4 1 7 ... |
| user output |
|---|
| 0 |
Test 10
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1000 0 0 1 1 2 2 3 3 ... |
| correct output |
|---|
| 1 1 0 0 0 ... |
| user output |
|---|
| inf |
Test 11
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 1000 0 1000 0 999 1 1000 0 998 ... |
| correct output |
|---|
| 9 8 8 8 7 ... |
| user output |
|---|
| inf |
Test 12
Group: 1, 2, 3
Verdict: RUNTIME ERROR
| input |
|---|
| 1 0 1000 |
| correct output |
|---|
| 9 |
| user output |
|---|
| (empty) |
Error:
Traceback (most recent call last):
File "input/code.py", line 30, in <module>
a = li...Test 13
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 0 100000 0 100000 0 100000 0 100000 ... |
| correct output |
|---|
| 33 33 33 33 33 ... |
| user output |
|---|
| inf |
Test 14
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 86042 98295 30077 80920 45856 67174 3890 60412 ... |
| correct output |
|---|
| 0 0 0 16 0 ... |
| user output |
|---|
| 0 |
Test 15
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 11 10000 1111 11000 1011 1100 1110 1111 ... |
| correct output |
|---|
| 14 10 2 2 8 ... |
| user output |
|---|
| 0 |
Test 16
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 9 9999 1109 1110 112 1012 11098 11101 ... |
| correct output |
|---|
| 14 1 4 2 6 ... |
| user output |
|---|
| 0 |
Test 17
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 0 0 1 1 2 2 3 3 ... |
| correct output |
|---|
| 1 1 0 0 0 ... |
| user output |
|---|
| inf |
Test 18
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 0 100000 0 99999 1 100000 0 99998 ... |
| correct output |
|---|
| 33 32 32 32 31 ... |
| user output |
|---|
| inf |
Test 19
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 3 99999 99999 99999 100000 100000 100000 |
| correct output |
|---|
| 0 1 1 |
| user output |
|---|
| 0 |
Test 20
Group: 2, 3
Verdict: RUNTIME ERROR
| input |
|---|
| 1 0 100000 |
| correct output |
|---|
| 33 |
| user output |
|---|
| (empty) |
Error:
Traceback (most recent call last):
File "input/code.py", line 30, in <module>
a = li...Test 21
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 0 1000000000000000000 0 1000000000000000000 0 1000000000000000000 0 1000000000000000000 ... |
| correct output |
|---|
| 262145 262145 262145 262145 262145 ... |
| user output |
|---|
| inf |
Test 22
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 179926689319432205 25677963778... |
| correct output |
|---|
| 0 0 0 0 0 ... |
| user output |
|---|
| 0 |
Test 23
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 100110100011010101 11100011010... |
| correct output |
|---|
| 74822 54944 140968 252594 23521 ... |
| user output |
|---|
| 0 |
Test 24
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 100110100011010102 11100011010... |
| correct output |
|---|
| 74822 252594 94086 10836 11352 ... |
| user output |
|---|
| 0 |
Test 25
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 256779637786129463 25677963778... |
| correct output |
|---|
| 0 0 0 0 0 ... |
| user output |
|---|
| 0 |
Test 26
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 100000 0 1000000000000000000 0 999999999999999999 1 1000000000000000000 0 999999999999999998 ... |
| correct output |
|---|
| 262145 262144 262144 262144 262143 ... |
| user output |
|---|
| inf |
Test 27
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| 3 999999999999999999 99999999999... |
| correct output |
|---|
| 0 1 1 |
| user output |
|---|
| 0 |
Test 28
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 1 0 1000000000000000000 |
| correct output |
|---|
| 262145 |
| user output |
|---|
| (empty) |
Error:
Traceback (most recent call last):
File "input/code.py", line 30, in <module>
a = li...