237302026-01-28 13:24:38sarminJárda-L (40)cpp17Accepted 40/402ms504 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// const ll MOD = 1e9+7;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

	int n; cin >> n;
    vector<array<ll, 2>> dp(n+1);
    dp[1] = {0, 1}; dp[2] = {2, 2};
    for (int i = 3; i <= n; i++) {
    	dp[i][0] = dp[i-1][0] + dp[i-2][1] * 2;
    	dp[i][1] = dp[i-1][0] + dp[i-1][1] + dp[i-2][1];
    }

	cout << dp[n][1] << "\n";
	
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/01ms316 KiB
2Accepted0/01ms504 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms360 KiB
8Accepted3/31ms316 KiB
9Accepted3/32ms316 KiB
10Accepted3/31ms316 KiB
11Accepted3/31ms316 KiB
12Accepted3/31ms316 KiB
13Accepted3/31ms316 KiB
14Accepted3/31ms316 KiB
15Accepted3/31ms316 KiB
16Accepted3/31ms316 KiB
17Accepted3/31ms364 KiB