212132026-01-12 17:07:31algoproJárdakövezés háromféle elemmelcpp17Wrong answer 4/302ms1076 KiB
// UUID: 8db2bcc9-edfa-4e41-be56-0ed565c8d9f8
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;cin>>n;
	vector<array<int, 2>> dp(n+1);
	dp[1][0]=1;
	dp[1][1]=2;
	dp[2][0]=4;
	dp[2][1]=11;
	for(int i=3;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]+3*dp[i-1][0]+2*dp[i-2][1]+dp[i][0];
	}
	cout<<dp[n][1]<<'\n';
}
SubtaskSumTestVerdictTimeMemory
base4/30
1Accepted0/01ms500 KiB
2Accepted0/01ms316 KiB
3Accepted2/21ms500 KiB
4Accepted2/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms380 KiB
7Wrong answer0/22ms508 KiB
8Wrong answer0/21ms316 KiB
9Wrong answer0/21ms568 KiB
10Wrong answer0/21ms564 KiB
11Wrong answer0/21ms1012 KiB
12Wrong answer0/31ms820 KiB
13Wrong answer0/31ms316 KiB
14Wrong answer0/31ms316 KiB
15Wrong answer0/32ms1076 KiB