9487 | 2024. 02. 22 11:23:30 | AGergo | Szigetek (35 pont) | cpp17 | Elfogadva 35/35 | 13ms | 4896 KiB |
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> price;
vector<int> lowestPrice; // lowest price to get to any island
int main()
{
cin.tie(0);ios::sync_with_stdio(0);
cin >> n;
price.resize(n+1);
lowestPrice.resize(n+1,INT_MAX);
for(int i = 0; i < n; i++)
{
cin >> price[i+1];
}
lowestPrice[1] = price[1];
lowestPrice[2] = price[1]+price[2];
for(int i = 3; i < n+1;i++)
{
lowestPrice[i] = min(lowestPrice[i-1],lowestPrice[i-2])+price[i];
}
// bejar(1,price[1]);
cout << lowestPrice[n];
}
Részfeladat | Összpont | Teszt | Verdikt | Idő | Memória | ||
---|---|---|---|---|---|---|---|
base | 35/35 | ||||||
1 | Elfogadva | 0/0 | 3ms | 1892 KiB | |||
2 | Elfogadva | 0/0 | 13ms | 3580 KiB | |||
3 | Elfogadva | 1/1 | 3ms | 2336 KiB | |||
4 | Elfogadva | 1/1 | 3ms | 2508 KiB | |||
5 | Elfogadva | 1/1 | 3ms | 2732 KiB | |||
6 | Elfogadva | 1/1 | 3ms | 2944 KiB | |||
7 | Elfogadva | 1/1 | 3ms | 3164 KiB | |||
8 | Elfogadva | 2/2 | 3ms | 3260 KiB | |||
9 | Elfogadva | 2/2 | 3ms | 3264 KiB | |||
10 | Elfogadva | 2/2 | 3ms | 3268 KiB | |||
11 | Elfogadva | 2/2 | 3ms | 3260 KiB | |||
12 | Elfogadva | 2/2 | 3ms | 3468 KiB | |||
13 | Elfogadva | 2/2 | 3ms | 3404 KiB | |||
14 | Elfogadva | 2/2 | 4ms | 3592 KiB | |||
15 | Elfogadva | 2/2 | 6ms | 3912 KiB | |||
16 | Elfogadva | 2/2 | 8ms | 4228 KiB | |||
17 | Elfogadva | 2/2 | 9ms | 4352 KiB | |||
18 | Elfogadva | 2/2 | 10ms | 4744 KiB | |||
19 | Elfogadva | 2/2 | 12ms | 4896 KiB | |||
20 | Elfogadva | 2/2 | 12ms | 4796 KiB | |||
21 | Elfogadva | 2/2 | 13ms | 4876 KiB | |||
22 | Elfogadva | 2/2 | 13ms | 4872 KiB |