211982026-01-12 17:01:31algoproJárdakövezés háromféle elemmelcpp17Wrong answer 4/3035ms32000 KiB
// UUID: 0fdca55c-5bcf-42f3-93f4-ce33f59ead9a
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
	cin >> n;
	vector<vector<int>> dp(n+1, vector<int>(n+1, 1));	//0 - egy kilóg, 1 - teli
	dp[1][0] = 1;
	dp[1][1] = 2;
	for(int i=2;i<=n;i++){
		dp[i][0] = dp[i-1][0] + dp[i-1][1] + dp[i-2][1];
		dp[i][1] = dp[i-1][1] + dp[i-1][0]*3 + dp[i][0] + dp[i-2][1] * 2;
	}
	cout << dp[n][1];
}
SubtaskSumTestVerdictTimeMemory
base4/30
1Accepted0/01ms508 KiB
2Accepted0/01ms500 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/21ms316 KiB
9Runtime error0/234ms32000 KiB
10Runtime error0/228ms32000 KiB
11Runtime error0/227ms32000 KiB
12Runtime error0/334ms32000 KiB
13Runtime error0/334ms32000 KiB
14Runtime error0/335ms32000 KiB
15Runtime error0/327ms32000 KiB