227092026-01-15 17:01:27algoproJárdakövezés háromféle elemmelcpp17Wrong answer 0/302ms1076 KiB
// UUID: 30056b30-4c87-4a38-a8a7-1d3748b7e2d7
#include <bits/stdc++.h>
#include <vector>
using namespace std;

int main() {
	int n; cin >> n;
	vector<pair<int,int>> dp(n + 1);
	dp[1].first = 2;
	dp[1].second = 2;
	dp[0].second = 1;
	for (int i = 2;i <= n;i++) {
		dp[i].first = 2 * dp[i - 2].second + dp[i - 1].first + 2 * dp[i - 1].second;
		dp[i].second = /*1x1 block*/(dp[i].first - dp[i - 1].second/2) + dp[i - 1].second + dp[i - 1].first;
	}
	cout << dp[n].first << " " << dp[n].second;
}
SubtaskSumTestVerdictTimeMemory
base0/30
1Wrong answer0/01ms316 KiB
2Wrong answer0/01ms316 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/21ms332 KiB
9Wrong answer0/21ms564 KiB
10Wrong answer0/21ms564 KiB
11Wrong answer0/22ms820 KiB
12Wrong answer0/31ms828 KiB
13Wrong answer0/31ms316 KiB
14Wrong answer0/31ms316 KiB
15Wrong answer0/32ms1076 KiB