제출 #1009711

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1009711		Double_Slash	Linear Garden (IOI08_linear_garden)	C++17	100 / 100	55 ms	38604 KiB

linear_garden

#include <bits/stdc++.h>

using namespace std;

int n, m, dp[1000001][3][3];

int main() {
    cin >> n >> m;
    for (int mn = 0; mn <= 2; ++mn) {
        for (int mx = max(mn, 2); mx <= 4; ++mx) {
            dp[n][mn][mx - 2] = 1;
        }
    }
    for (int i = n; i--;) {
        for (int mn = 0; mn <= 2; ++mn) {
            for (int mx = max(mn, 2); mx <= 4; ++mx) {
                if (mn > 0) dp[i][mn][mx - 2] += dp[i + 1][mn - 1][max(2, mx - 1) - 2];
                if (mx < 4) dp[i][mn][mx - 2] += dp[i + 1][min(2, mn + 1)][mx + 1 - 2];
                dp[i][mn][mx - 2] %= m;
            }
        }
    }
    string s;
    cin >> s;
    int ans = 1;
    for (int i = 0, mn = 2, mx = 2; i < n; ++i) {
        if (s[i] == 'P') {
            if (mn > 0) ans = (ans + dp[i + 1][mn - 1][max(2, mx - 1) - 2]) % m;
            mn = min(2, mn + 1);
            mx++;
        } else {
            mn--;
            mx = max(2, mx - 1);
        }
    }
    cout << ans << endl;
}

• 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