제출 #1339265

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1339265		North1304	Linear Garden (IOI08_linear_garden)	C++20	100 / 100	65 ms	36760 KiB

linear_garden

#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 1;
int dp[N][3][3];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    int n,mod;
    string s;
    cin >> n >> mod >> s;
    for (int i=0;i<=2;i++) {
        for (int j=0;j<=2;j++) {
            if (i+j<=2) dp[0][i][j] = 1;
        }
    }
    for (int i=1;i<=n;i++) {
        for (int j=0;j<=2;j++) {
            for (int k=0;k<=2;k++) {
                if (j+k>2) continue;
                if (j<2) {
                    dp[i][j][k] += dp[i-1][j+1][max(0,k-1)];
                    dp[i][j][k] %= mod;
                }
                if (k<2) {
                    dp[i][j][k] += dp[i-1][max(0,j-1)][k+1];
                    dp[i][j][k] %= mod;
                }
            }
        }
    }
    int ans = 1;
    int x = 0 , y = 0;
    for (int i=0;i<n;i++) {
        if (s[i]=='P') {
            if (x<2) {
                ans += dp[n-i-1][x+1][max(0,y-1)];
                ans %= mod;
            }
            if (x) x--;
            y++;
        }
        else {
            x++;
            if (y) y--;
        }
    }
    cout << ans;
    return 0;
}

• 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