제출 #1046127

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1046127		Zicrus	Linear Garden (IOI08_linear_garden)	C++17	100 / 100	51 ms	41400 KiB

linear_garden

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

int G[3][3] = {{0, 1, 2},
               {3, 4, -1},
               {5, -1, -1}};

int main() {
    int n, m;
    cin >> n >> m;
    string s;
    cin >> s;
    vector<int*> dp(n+1);
    for (int i = 0; i <= n; i++) {
        dp[i] = new int[6];
    }
    dp[n][G[0][0]] = dp[n][G[1][1]] = 1;
    dp[n][G[1][0]] = dp[n][G[0][1]] = 1;
    dp[n][G[2][0]] = dp[n][G[0][2]] = 1;
    for (int i = n-1; i >= 0; i--) {
        dp[i][G[0][0]] = (dp[i+1][G[1][0]] + dp[i+1][G[0][1]]) % m;
        dp[i][G[1][1]] = (dp[i+1][G[2][0]] + dp[i+1][G[0][2]]) % m;
        dp[i][G[1][0]] = (dp[i+1][G[2][0]] + dp[i+1][G[0][1]]) % m;
        dp[i][G[0][1]] = (dp[i+1][G[1][0]] + dp[i+1][G[0][2]]) % m;
        dp[i][G[2][0]] = dp[i][G[0][2]] = dp[i+1][G[1][1]] % m;
    }

    int res = 1;
    int low = 0, high = 0;
    for (int i = 0; i < n; i++) {
        if (s[i] == 'P') {
            if (low > -2) res += dp[i+1][G[-(low-1)][max(0, high-1)]];
            res %= m;

            low = min(0, low+1);
            high++;
        }
        else {
            low--;
            high = max(0, high-1);
        }
    }

    cout << res;
}

• 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: 4 / 4
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 5 / 5
• Subtask 18: 5 / 5
• Subtask 19: 5 / 5
• Subtask 20: 5 / 5
• Subtask 21: 5 / 5
• Subtask 22: 5 / 5
• Subtask 23: 5 / 5