제출 #239180

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
239180		osaaateiasavtnl	Linear Garden (IOI08_linear_garden)	C++14	36 / 100	293 ms	13212 KiB

linear_garden

#include<bits/stdc++.h>
using namespace std;
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC

const int N = 1e6 + 7;
const int C = 3;
int MOD;

int dp1[C][C][2 * C], dp2[C][C][2 * C];

signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif

    int n, MOD;
    string s;
    cin >> n >> MOD >> s;

    for (int mn = 0; mn < C; ++mn)  
        for (int mx = 0; mx < C; ++mx)
            for (int cur = 0; cur < 2 * C; ++cur)
                if (mn + mx <= 2)
                    dp1[mn][mx][cur] = 1;

    vector <int> mn(n + 1), mx(n + 1), cur(n + 1);

    int ans = 1;
    for (int i = 0; i < n; ++i) {
        cur[i + 1] = cur[i];
        if (s[i] == 'P') {
            ++cur[i + 1];
        }   
        else {
            --cur[i + 1];
        }   
        mn[i + 1] = min(mn[i], cur[i + 1]);
        mx[i + 1] = max(mx[i], cur[i + 1]);
    }   

    auto add = [&](int &a, int b) {
        a += b;
        a %= MOD;
    };

    vector <int> can = {-1, 1};
    for (int i = n - 1; i >= 0; --i) {
        /*
        cout << "len : " << n - i - 1 << endl;
        for (int x = 0; x < C; ++x)
            for (int y = 0; y < C; ++y) 
                for (int z = 0; z < 2 * C; ++z)
                    if (dp1[x][y][z]) {
                        cout << -x << ' ' << y << ' ' << z - 2 << " : " << dp1[x][y][z] << endl;
                    }   
        */

        if (s[i] == 'P') {

            int cur1 = cur[i]-1;
            int mn1 = abs(mn[i]);
            if (cur1 < 0)
                mn1 = max(mn1, -cur1);
            int mx1 = max(mx[i], cur1);

            if (mn1 <= 2 && mx1 <= 2) {
                ans = (ans + dp1[mn1][mx1][cur1+2]);
            }
        }   

        memset(dp2, 0, sizeof dp2);

        for (int mn = 0; mn <= 2; ++mn) {
            for (int mx = 0; mx <= 2; ++mx) {
                for (int cur = -mn; cur <= mx; ++cur) {
                    //shift cur by 2

                    for (int x : can) {
                        int cur1 = cur + x;
                        int mn1 = mn;
                        if (cur1 < 0)
                            mn1 = max(mn1, -cur1);

                        int mx1 = max(mx, cur1);

                        /*
                        if (mn1 == 0 && mx1 == 2 && cur1 + 2 == 5) {
                            cout << "LMAO" << endl;
                            exit(0);
                        }
                        */  

                        if (mn1 + mx1 <= 2) {
                            add(dp2[mn][mx][cur+2], dp1[mn1][mx1][cur1+2]);
                            //add(dp2[mn1][mx1][cur1 + 2], dp1[mn][mx][cur + 2]);
                        }   
                    }   

                }   
            }   
        }   

        for (int x = 0; x < C; ++x)
            for (int y = 0; y < C; ++y) 
                for (int z = 0; z < 2 * C; ++z)
                    dp1[x][y][z] = dp2[x][y][z];
    }   

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