Submission #8,827

2024-01-31 17:27:55

python3

Accepted 35/35

75ms

34596 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]


def min_cost2():
    N = int(input())
    fees = list(map(int, input().split()))

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

    return b


print(min_cost2())

	Sum	Test	Verdict		Time	Memory
base	35/35
		1	Accepted	0/0	18ms	10996 KiB
		2	Accepted	0/0	75ms	32460 KiB
		3	Accepted	1/1	17ms	11940 KiB
		4	Accepted	1/1	17ms	11872 KiB
		5	Accepted	1/1	17ms	12240 KiB
		6	Accepted	1/1	17ms	11896 KiB
		7	Accepted	1/1	17ms	12128 KiB
		8	Accepted	2/2	18ms	12240 KiB
		9	Accepted	2/2	18ms	12820 KiB
		10	Accepted	2/2	18ms	12824 KiB
		11	Accepted	2/2	20ms	13276 KiB
		12	Accepted	2/2	20ms	13944 KiB
		13	Accepted	2/2	23ms	14364 KiB
		14	Accepted	2/2	29ms	16532 KiB
		15	Accepted	2/2	35ms	18992 KiB
		16	Accepted	2/2	48ms	23864 KiB
		17	Accepted	2/2	57ms	28168 KiB
		18	Accepted	2/2	65ms	30568 KiB
		19	Accepted	2/2	74ms	32524 KiB
		20	Accepted	2/2	68ms	32464 KiB
		21	Accepted	2/2	74ms	34212 KiB
		22	Accepted	2/2	75ms	34596 KiB