Submission #14,823

2025-02-03 15:14:38

cpp17

Accepted 35/35

26ms

1176 KiB

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
	int n;
	cin >> n;
	vector<int> best(n);
	cin >> best[0] >> best[1];
	best[1] += best[0];
	for (int i = 2; i < n; i++) {
		int p;
		cin >> p;
		best[i] = min(best[i - 2] + p, best[i - 1] + p);
	}
	cout << best[n - 1];
	return 0;
}

	Sum	Test	Verdict		Time	Memory
base	35/35
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	26ms	1076 KiB
		3	Accepted	1/1	1ms	508 KiB
		4	Accepted	1/1	1ms	400 KiB
		5	Accepted	1/1	1ms	316 KiB
		6	Accepted	1/1	1ms	508 KiB
		7	Accepted	1/1	1ms	316 KiB
		8	Accepted	2/2	1ms	316 KiB
		9	Accepted	2/2	1ms	408 KiB
		10	Accepted	2/2	2ms	316 KiB
		11	Accepted	2/2	2ms	316 KiB
		12	Accepted	2/2	2ms	316 KiB
		13	Accepted	2/2	3ms	316 KiB
		14	Accepted	2/2	6ms	548 KiB
		15	Accepted	2/2	8ms	620 KiB
		16	Accepted	2/2	13ms	792 KiB
		17	Accepted	2/2	17ms	948 KiB
		18	Accepted	2/2	20ms	820 KiB
		19	Accepted	2/2	23ms	1076 KiB
		20	Accepted	2/2	23ms	1076 KiB
		21	Accepted	2/2	26ms	1176 KiB
		22	Accepted	2/2	26ms	1076 KiB