제출 #160195

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
160195		johutha	Linear Garden (IOI08_linear_garden)	C++14	36 / 100	332 ms	57164 KiB

linear_garden

#include <iostream>
#include <vector>

#define int int64_t

using namespace std;

signed main()
{
    int n, m;
    string st;
    cin >> n >> m >> st;
    vector<vector<int>> nrstrings(n + 1, vector<int>(3, 0));
    nrstrings[0][0] = 1;
    nrstrings[1][0] = 1;

    for (int i = 2; i <= n; i++)
    {
        nrstrings[i][1] += nrstrings[i - 1][0];
        nrstrings[i][1] += nrstrings[i - 1][2];
        if (i > 1)
        {
            nrstrings[i][0] += nrstrings[i - 2][0];
            nrstrings[i][1] += nrstrings[i - 2][1];
            nrstrings[i][2] += nrstrings[i - 2][2];
        }
        if (i > 2)
        {
            nrstrings[i][2] += nrstrings[i - 3][0];
            nrstrings[i][2] += nrstrings[i - 3][1];
        }
        nrstrings[i][0] %= m;
        nrstrings[i][1] %= m;
        nrstrings[i][2] %= m;
    }

    int res = 1;

    char bef = '0';
    char doub = '1';

    for (int i = 0; i < n; i++)
    {
        if (st[i] == 'P' && bef != doub)
    	{
            res += nrstrings[n - i][0];
			if (doub != 'P' || bef == 'L') res += nrstrings[n - i][2];
			if (doub != 'L' && bef != 'L') res += nrstrings[n - i][1];
        }
        if (st[i] == bef)
        {
            doub = st[i];
        }
        bef = st[i];
    }
    cout << res << "\n";
}

• Subtask 1: 2 / 2
• Subtask 2: 2 / 2
• Subtask 3: 4 / 4
• Subtask 4: 4 / 4
• Subtask 5: 4 / 4
• Subtask 6: 4 / 4
• Subtask 7: 4 / 4
• Subtask 8: 4 / 4
• Subtask 9: 4 / 4
• Subtask 10: 4 / 4
• Subtask 11: 0 / 4
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5
• Subtask 21: 0 / 5
• Subtask 22: 0 / 5
• Subtask 23: 0 / 5