제출 #890635

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
890635		Macker	Linear Garden (IOI08_linear_garden)	C++17	86 / 100	327 ms	3444 KiB

linear_garden

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define all(v) v.begin(), v.end()

ll dp[3][3][5]; //mx, mn, cur
ll ldp[3][3][5]; //mx, mn, cur
ll m;

int main()
{
    int n; cin >> n; cin >> m;
    string s; cin >> s;
    memset(dp, 0, 3*3*5*sizeof(ll));
    memset(ldp, 0, 3*3*5*sizeof(ll));
    int cmx, cmn, ccur;
    if(s[0] == 'P'){
        dp[1][0][3] = 1;
        cmx = 1, cmn = 0, ccur = 3;
    }
    else{
        cmx = 0, cmn = 1, ccur = 1;
    }
    dp[0][1][1] = 1;
    for (int i = 0; i < n - 1; i++)
    {
        swap(dp, ldp);
        memset(dp, 0, 3*3*5*sizeof(ll));
        for (int mx = 0; mx < 3; mx++)
        for (int mn = 0; mn < 3; mn++)
        for (int cur = 0; cur < 5; cur++) {
            for (ll a = -1; a < 2; a += 2) {
                int acur = cur - 2 + a;
                int amx = max(mx, acur);
                int amn = min(-mn, acur);
                if(amx > 2 || amn < -2 || amx - acur > 2 || acur - amn > 2) continue;
                dp[amx][-amn][acur + 2] += max(ldp[mx][mn][cur], 0LL);
                dp[amx][-amn][acur + 2] %= m;
            }
        }
        if(ccur + 1 < 5 && s[i + 1] == 'L')
            dp[max(cmx, ccur - 2 + 1)][cmn][ccur + 1]--;
        if(s[i + 1] == 'P') ccur++;
        else ccur--;
        cmx = max(ccur - 2, cmx);
        cmn = max(-(ccur - 2), cmn);
    }
    ll res = 0;
    for (int mx = 0; mx < 3; mx++)
    for (int mn = 0; mn < 3; mn++)
    for (int cur = 0; cur < 5; cur++){
        res += dp[mx][mn][cur];
        res %= m;
    }
    cout << res << endl;
}

• Subtask 1: 2 / 2
• Subtask 2: 2 / 2
• Subtask 3: 0 / 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: 0 / 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: 0 / 5
• Subtask 23: 5 / 5