제출 #115074

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
115074		zubec	Linear Garden (IOI08_linear_garden)	C++14	100 / 100	113 ms	36740 KiB

linear_garden

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;

int n, m, dp[2][1000100][2][2];

int a[1000100];

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);

    cin >> n >> m;

    for (int i = 1; i <= n; i++){
        char c;
        cin >> c;
        a[i] = (c == 'P');
    }
    if (a[1] == 0){
        dp[1][1][0][0] = 1;
        dp[1][1][0][1] = 1;
    } else {
        dp[0][1][0][0] = 1;
        dp[0][1][0][1] = 1;
        dp[1][1][1][0] = 1;
        dp[1][1][1][1] = 1;
    }
    for (int i = 1; i < n; i++){
        for (int cur = 0; cur < 2; cur++){
            for (int nxt = 0; nxt < 2; nxt++){
                for (int pref = 0; pref < 2; pref++){
                    if (pref && nxt > a[i+1])
                        continue;
                    for (int used = 0; used < 2; used++){
                        if (cur == nxt && cur == 0 && used == 1)
                            continue;
                        if (cur == nxt && cur == 1 && used == 0)
                            continue;
                        int nxtpref = pref;
                        if (nxt < a[i+1])
                            nxtpref = 0;
                        int nxtused = used;
                        if (cur == nxt)
                            nxtused ^= 1;
                        dp[nxtpref][i+1][nxt][nxtused] = (dp[nxtpref][i+1][nxt][nxtused] + dp[pref][i][cur][used])%m;
                    }
                }
            }
        }
    }
    int ans = 0;
    for (int pref = 0; pref < 2; pref++){
        ans = (ans + dp[pref][n][0][0])%m;
        ans = (ans + dp[pref][n][1][0])%m;
        ans = (ans + dp[pref][n][0][1])%m;
        ans = (ans + dp[pref][n][1][1])%m;
    }

    memset(dp, 0, sizeof(dp));

    if (a[1] == 0){
        dp[1][1][0][0] = 1;
    } else {
        dp[0][1][0][0] = 1;
        dp[1][1][1][0] = 1;
    }
    for (int i = 1; i < n; i++){
        for (int cur = 0; cur < 2; cur++){
            for (int nxt = 0; nxt < 2; nxt++){
                if (cur == nxt)
                    continue;
                for (int pref = 0; pref < 2; pref++){
                    if (pref && nxt > a[i+1])
                        continue;
                    for (int used = 0; used < 2; used++){
                        if (cur == nxt && cur == 0 && used == 1)
                            continue;
                        if (cur == nxt && cur == 1 && used == 0)
                            continue;
                        int nxtpref = pref;
                        if (nxt < a[i+1])
                            nxtpref = 0;
                        int nxtused = used;
                        if (cur == nxt)
                            nxtused ^= 1;
                        dp[nxtpref][i+1][nxt][nxtused] = (dp[nxtpref][i+1][nxt][nxtused] + dp[pref][i][cur][used])%m;
                    }
                }
            }
        }
    }
    int ans2 = 0;
    for (int pref = 0; pref < 2; pref++){
        ans2 = (ans2 + dp[pref][n][0][0])%m;
        ans2 = (ans2 + dp[pref][n][1][0])%m;
    }
    ans = (ans - ans2 + m)%m;

    cout << ans;


}

/**

5 7
LLPPL

5 1000
LPLPL

*/

• 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