212162026-01-12 17:08:15algoproSzigetek (35 pont)pypy3Wrong answer 0/3576ms32000 KiB
# UUID: aab6b35a-529e-467c-ac6d-ab9811626eaf
n = int(input())
dij = list(map(int, input().split()))
op = [0 for i in range(n)]

op[0] = dij[0]
op[1] = dij[0] + dij[1]

for i in range(2, len(dij)):
    op[i] = min(op[i-1], op[i-2]) + dij[i]

print(0)
SubtaskSumTestVerdictTimeMemory
base0/35
1Wrong answer0/043ms19344 KiB
2Runtime error0/075ms32000 KiB
3Wrong answer0/139ms19396 KiB
4Wrong answer0/139ms19400 KiB
5Wrong answer0/141ms19440 KiB
6Wrong answer0/145ms19436 KiB
7Wrong answer0/139ms19556 KiB
8Wrong answer0/241ms21172 KiB
9Wrong answer0/250ms21472 KiB
10Wrong answer0/250ms21704 KiB
11Wrong answer0/256ms21684 KiB
12Wrong answer0/257ms21540 KiB
13Wrong answer0/257ms21540 KiB
14Wrong answer0/261ms23588 KiB
15Wrong answer0/254ms24328 KiB
16Wrong answer0/257ms26960 KiB
17Wrong answer0/271ms29648 KiB
18Wrong answer0/267ms30984 KiB
19Wrong answer0/276ms31892 KiB
20Runtime error0/271ms32000 KiB
21Runtime error0/267ms32000 KiB
22Runtime error0/272ms32000 KiB