Submission #8,826

2024-01-31 17:24:14

python3

Accepted 35/35

92ms

37148 KiB

def min_cost():
    N = int(input())
    fees = list(map(int, input().split()))
    min_fees = [0] * N

    min_fees[0] = fees[0]
    min_fees[1] = fees[0] + fees[1]
    for i in range(2, N):
        min_fees[i] = min(min_fees[i - 1], min_fees[i - 2]) + fees[i]

    return min_fees[N - 1]


print(min_cost())

	Sum	Test	Verdict		Time	Memory
base	35/35
		1	Accepted	0/0	17ms	10960 KiB
		2	Accepted	0/0	92ms	32576 KiB
		3	Accepted	1/1	18ms	11924 KiB
		4	Accepted	1/1	17ms	12136 KiB
		5	Accepted	1/1	17ms	12396 KiB
		6	Accepted	1/1	17ms	12264 KiB
		7	Accepted	1/1	17ms	12528 KiB
		8	Accepted	2/2	18ms	12800 KiB
		9	Accepted	2/2	18ms	13028 KiB
		10	Accepted	2/2	19ms	13020 KiB
		11	Accepted	2/2	20ms	13452 KiB
		12	Accepted	2/2	20ms	14260 KiB
		13	Accepted	2/2	25ms	14820 KiB
		14	Accepted	2/2	32ms	16512 KiB
		15	Accepted	2/2	39ms	18480 KiB
		16	Accepted	2/2	54ms	22972 KiB
		17	Accepted	2/2	68ms	28836 KiB
		18	Accepted	2/2	74ms	30800 KiB
		19	Accepted	2/2	79ms	33180 KiB
		20	Accepted	2/2	81ms	35044 KiB
		21	Accepted	2/2	87ms	36244 KiB
		22	Accepted	2/2	90ms	37148 KiB