Submission #1019369

#	Time	Username	Problem	Language	Result	Execution time	Memory
1019369		ttamx	Linear Garden (IOI08_linear_garden)	C++17	80 / 100	106 ms	65536 KiB

linear_garden

#include<bits/stdc++.h>

using namespace std;

const int N=1e6+5;

int n,m;
int dp[N][3][3][5];
string s;

int& norm(int &x){
    return x%=m;
}

int main(){
    cin >> n >> m;
    cin >> s;
    dp[0][0][0][2]=1;
    for(int i=1;i<=n;i++){
        for(int j=0;j<3;j++){
            for(int k=0;k<3;k++){
                for(int x=-2;x<=2;x++){
                    if(x<2)norm(dp[i][j][max(k,x+1)][x+3]+=dp[i-1][j][k][x+2]);
                    if(x>-2)norm(dp[i][max(j,-x+1)][k][x+1]+=dp[i-1][j][k][x+2]);
                }
            }
        }
    }
    int mn=0,mx=0,cur=0,ans=1;
    for(int i=0;i<n;i++){
        if(s[i]=='P'){
            int val=cur+1;
            for(int j=0;j<3;j++){
                for(int k=0;k<3;k++){
                    int mn2=min(mn,val-j);
                    int mx2=max(mx,val+k);
                    if(mx2-mn2<=2){
                        for(int x=0;x<5;x++){
                            norm(ans+=dp[n-i-1][j][k][x]);
                        }
                    }
                }
            }
        }
        cur+=s[i]=='L'?1:-1;
        mn=min(mn,cur);
        mx=max(mx,cur);
    }
    cout << ans;
}

• 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: 0 / 5
• Subtask 21: 0 / 5
• Subtask 22: 0 / 5
• Subtask 23: 0 / 5