212662026-01-12 17:36:42algoproJárdakövezés háromféle elemmelcpp17Wrong answer 4/30200ms1076 KiB
// UUID: f28d6864-a5ae-4bc3-8e79-922c0b79406f
#include <bits/stdc++.h>
using namespace std;
int mod = 2023;

int main() {
	int n; cin >> n;
	vector<array<int, 2>> dp (n+1);
	dp[0][0] = 1;
	dp[0][1] = 1;
	dp[1][0] = 1;
	dp[1][1] = 2;
	for (int i = 2; i <= n; i++) {
		dp[i][0] = dp[i-1][1] + dp[i-1][0] + dp[i-2][1] % mod;
		dp[i][1] = dp[i][0] + dp[i-1][1] + 2*dp[i-2][1] + 3*dp[i-1][0] % mod;
		cerr << dp[i][0] << " " << dp[i-1][1] << " 2*" << dp[i-2][1] << " 3*" << dp[i-1][0] << endl;
	}
	cout << dp[n][1];
}
SubtaskSumTestVerdictTimeMemory
base4/30
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted2/21ms512 KiB
4Accepted2/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/21ms316 KiB
9Wrong answer0/297ms564 KiB
10Time limit exceeded0/2108ms564 KiB
11Time limit exceeded0/2200ms820 KiB
12Time limit exceeded0/3199ms988 KiB
13Wrong answer0/329ms464 KiB
14Wrong answer0/337ms316 KiB
15Time limit exceeded0/3177ms1076 KiB