Submission #21,229

2026-01-12 17:15:47

pypy3

Accepted 35/35

74ms

31816 KiB

# UUID: aa277d1e-6aba-44df-a158-d986032edf29
n = int(input())
dij = [int(x) for x in input().split()]
op = [0]*n

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

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

print(op[n-1])

	Sum	Test	Verdict		Time	Memory
base	35/35
		1	Accepted	0/0	37ms	19444 KiB
		2	Accepted	0/0	67ms	31708 KiB
		3	Accepted	1/1	43ms	19376 KiB
		4	Accepted	1/1	41ms	19340 KiB
		5	Accepted	1/1	43ms	19436 KiB
		6	Accepted	1/1	39ms	19616 KiB
		7	Accepted	1/1	37ms	19460 KiB
		8	Accepted	2/2	50ms	21160 KiB
		9	Accepted	2/2	56ms	21416 KiB
		10	Accepted	2/2	56ms	21828 KiB
		11	Accepted	2/2	50ms	21464 KiB
		12	Accepted	2/2	50ms	21744 KiB
		13	Accepted	2/2	50ms	21480 KiB
		14	Accepted	2/2	57ms	22420 KiB
		15	Accepted	2/2	57ms	23192 KiB
		16	Accepted	2/2	56ms	25540 KiB
		17	Accepted	2/2	61ms	28556 KiB
		18	Accepted	2/2	71ms	29628 KiB
		19	Accepted	2/2	64ms	30620 KiB
		20	Accepted	2/2	74ms	30696 KiB
		21	Accepted	2/2	65ms	31660 KiB
		22	Accepted	2/2	74ms	31816 KiB