Submission #21,171

2026-01-12 16:34:18

pypy3

Accepted 35/35

76ms

31476 KiB

# UUID: 0871af21-bebb-49bb-b517-3254869a8f8c
import sys
input = sys.stdin.readline

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

solve()

	Sum	Test	Verdict		Time	Memory
base	35/35
		1	Accepted	0/0	39ms	19452 KiB
		2	Accepted	0/0	74ms	31380 KiB
		3	Accepted	1/1	43ms	19552 KiB
		4	Accepted	1/1	39ms	19404 KiB
		5	Accepted	1/1	39ms	19388 KiB
		6	Accepted	1/1	39ms	19400 KiB
		7	Accepted	1/1	43ms	19356 KiB
		8	Accepted	2/2	50ms	21040 KiB
		9	Accepted	2/2	48ms	21472 KiB
		10	Accepted	2/2	48ms	21468 KiB
		11	Accepted	2/2	56ms	21608 KiB
		12	Accepted	2/2	54ms	21640 KiB
		13	Accepted	2/2	56ms	21688 KiB
		14	Accepted	2/2	50ms	22264 KiB
		15	Accepted	2/2	59ms	23096 KiB
		16	Accepted	2/2	54ms	25052 KiB
		17	Accepted	2/2	70ms	28288 KiB
		18	Accepted	2/2	61ms	29224 KiB
		19	Accepted	2/2	61ms	30236 KiB
		20	Accepted	2/2	71ms	30216 KiB
		21	Accepted	2/2	76ms	31468 KiB
		22	Accepted	2/2	64ms	31476 KiB