Submission #15,969

2025-03-26 08:49:02

pypy3

Accepted 35/35

79ms

31860 KiB

n = int(input())
cost = [int(x) for x in input().split()]
dp = [0] * n
dp[0] = cost[0]
dp[1] = cost[0] + cost[1]
for i in range(2, n):
    dp[i] = min(dp[i - 1], dp[i - 2]) + cost[i]
print(dp[n - 1])

"""
6
3 5 9 7 1 6
"""

	Sum	Test	Verdict		Time	Memory
base	35/35
		1	Accepted	0/0	41ms	19336 KiB
		2	Accepted	0/0	79ms	31860 KiB
		3	Accepted	1/1	39ms	19392 KiB
		4	Accepted	1/1	43ms	19360 KiB
		5	Accepted	1/1	41ms	19436 KiB
		6	Accepted	1/1	39ms	19328 KiB
		7	Accepted	1/1	46ms	19456 KiB
		8	Accepted	2/2	45ms	21072 KiB
		9	Accepted	2/2	50ms	21616 KiB
		10	Accepted	2/2	57ms	21660 KiB
		11	Accepted	2/2	57ms	21640 KiB
		12	Accepted	2/2	50ms	21604 KiB
		13	Accepted	2/2	50ms	21640 KiB
		14	Accepted	2/2	59ms	22392 KiB
		15	Accepted	2/2	61ms	23232 KiB
		16	Accepted	2/2	57ms	25572 KiB
		17	Accepted	2/2	71ms	28648 KiB
		18	Accepted	2/2	63ms	29416 KiB
		19	Accepted	2/2	74ms	30440 KiB
		20	Accepted	2/2	65ms	30704 KiB
		21	Accepted	2/2	75ms	31720 KiB
		22	Accepted	2/2	65ms	31820 KiB