Submission #21,230

2026-01-12 17:18:05

pypy3

Accepted 35/35

75ms

31880 KiB

# UUID: 5ebe5f7e-6dc4-424b-92d9-e766039bf1be

N = int(input())
D = [int(x) for x in input().split()]

DP = [D[0], D[0]+D[1]]+[0]*(N-2)

for i in range(2,len(D)):
    megoldas=min(DP[i-2]+D[i],DP[i-1]+D[i])
    DP[i]=megoldas
print(DP[-1])

	Sum	Test	Verdict		Time	Memory
base	35/35
		1	Accepted	0/0	45ms	19476 KiB
		2	Accepted	0/0	68ms	31676 KiB
		3	Accepted	1/1	43ms	19336 KiB
		4	Accepted	1/1	39ms	19384 KiB
		5	Accepted	1/1	45ms	19360 KiB
		6	Accepted	1/1	41ms	19436 KiB
		7	Accepted	1/1	39ms	19348 KiB
		8	Accepted	2/2	43ms	21124 KiB
		9	Accepted	2/2	50ms	21628 KiB
		10	Accepted	2/2	56ms	21656 KiB
		11	Accepted	2/2	56ms	21704 KiB
		12	Accepted	2/2	48ms	21624 KiB
		13	Accepted	2/2	50ms	21736 KiB
		14	Accepted	2/2	50ms	22508 KiB
		15	Accepted	2/2	59ms	24104 KiB
		16	Accepted	2/2	64ms	25952 KiB
		17	Accepted	2/2	61ms	28644 KiB
		18	Accepted	2/2	63ms	29460 KiB
		19	Accepted	2/2	74ms	30440 KiB
		20	Accepted	2/2	71ms	30704 KiB
		21	Accepted	2/2	75ms	31712 KiB
		22	Accepted	2/2	65ms	31880 KiB