73552024-01-08 10:16:05CWMJárdakövezés háromféle elemmelcpp17Wrong answer 0/304ms6104 KiB
#include <iostream>
#include <vector>
#include <set>
#include <queue>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> DPa = vector<int>(n+1);
    vector<int> DPb = vector<int>(n+1);
    vector<int> DPc = vector<int>(n + 1);
    DPa[0] = 1;
    DPa[1] = 2;
    DPb[0] = 0;
    DPb[1] = 2;
    DPc[0] = 1;
    DPc[1] = 2;
    for (size_t i = 1; i < n; i++)
    {
        //DPa cases
        DPa[i + 1] += DPc[i];
        DPa[i + 1] += 2 * DPb[i];
        DPa[i + 1] += 2 * DPb[i - 1];
        DPa[i + 1] += 2 * DPc[i - 1];
        DPa[i + 1] += DPa[i];
        DPa[i + 1] += DPa[i - 1];
        //DPb cases
        DPb[i + 1] += DPb[i];
        DPb[i + 1] += DPc[i];
        //DPc cases
        DPc[i + 1] += DPa[i];
    }
    cout << DPa[n];
}
SubtaskSumTestVerdictTimeMemory
base0/30
1Accepted0/03ms1684 KiB
2Wrong answer0/03ms1928 KiB
3Wrong answer0/23ms2176 KiB
4Wrong answer0/23ms2352 KiB
5Wrong answer0/23ms2564 KiB
6Wrong answer0/23ms2708 KiB
7Wrong answer0/23ms2924 KiB
8Wrong answer0/23ms2996 KiB
9Wrong answer0/23ms3724 KiB
10Wrong answer0/23ms3940 KiB
11Wrong answer0/24ms4748 KiB
12Wrong answer0/34ms5296 KiB
13Wrong answer0/33ms3984 KiB
14Wrong answer0/33ms4096 KiB
15Wrong answer0/34ms6104 KiB