1564 | 2022. 11. 25 12:03:07 | Bence | Járda-L (40) | cpp11 | Accepted 40/40 | 3ms | 4072 KiB |
#include <iostream>
#include <vector>
using namespace std;
vector<long long> x,y;
int n,i,j;
long long s;
int main()
{
cin>>n;
x.resize(n+1);
y.resize(n+1);
x[1]=1;
x[2]=2;
y[2]=2;
for(i=3; i<=n; ++i)
{
x[i]=x[i-1]+x[i-2]+y[i-1];
y[i]=2*x[i-2]+y[i-1];
}
cout<<x[n];
return 0;
}
Subtask | Sum | Test | Verdict | Time | Memory | ||
---|---|---|---|---|---|---|---|
base | 40/40 | ||||||
1 | Accepted | 0/0 | 3ms | 1744 KiB | |||
2 | Accepted | 0/0 | 2ms | 1996 KiB | |||
3 | Accepted | 2/2 | 2ms | 2068 KiB | |||
4 | Accepted | 2/2 | 2ms | 2080 KiB | |||
5 | Accepted | 2/2 | 2ms | 2208 KiB | |||
6 | Accepted | 2/2 | 2ms | 2416 KiB | |||
7 | Accepted | 2/2 | 2ms | 2536 KiB | |||
8 | Accepted | 3/3 | 2ms | 2592 KiB | |||
9 | Accepted | 3/3 | 2ms | 2832 KiB | |||
10 | Accepted | 3/3 | 2ms | 2924 KiB | |||
11 | Accepted | 3/3 | 2ms | 3128 KiB | |||
12 | Accepted | 3/3 | 2ms | 3240 KiB | |||
13 | Accepted | 3/3 | 2ms | 3448 KiB | |||
14 | Accepted | 3/3 | 2ms | 3680 KiB | |||
15 | Accepted | 3/3 | 2ms | 3680 KiB | |||
16 | Accepted | 3/3 | 2ms | 3872 KiB | |||
17 | Accepted | 3/3 | 2ms | 4072 KiB |