Submission #961004

#	Time	Username	Problem	Language	Result	Execution time	Memory
961004		hirayuu_oj	Linear Garden (IOI08_linear_garden)	C++17	0 / 100	58 ms	65536 KiB

linear_garden

#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(x) x.begin(),x.end()
using ll=long long;
const ll INF=1LL<<60;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N,M;
    cin>>N>>M;
    string S;
    cin>>S;
    int dp[1000010][5][5][2];
    rep(i,N+1){
        rep(j,5){
            rep(k,5){
                dp[i][j][k][0]=0;
                dp[i][j][k][1]=0;
            }
        }
    }
    dp[0][2][2][1]=1;
    rep(i,N){
        rep(j,5){
            rep(k,5){
                dp[i][j][k][0]%=M;
                dp[i][j][k][1]%=M;
                if(k+1<5){
                    dp[i+1][min(j+1,2)][k+1][0]+=dp[i][j][k][0];
                    if(S[i]=='P'){
                        dp[i+1][min(j+1,2)][k+1][0]+=dp[i][j][k][1];
                    }
                    else{
                        dp[i+1][min(j+1,2)][k+1][1]+=dp[i][j][k][1];
                    }
                }
                if(j-1>=0){
                    dp[i+1][j-1][max(2,k-1)][0]+=dp[i][j][k][0];
                    if(S[i]=='P'){
                        dp[i+1][j-1][max(2,k-1)][1]+=dp[i][j][k][1];
                    }
                }
            }
        }
    }
    int ans=0;
    rep(i,5){
        rep(j,5){
            ans+=dp[N][i][j][0];
            ans+=dp[N][i][j][1];
            ans%=M;
        }
    }
    cout<<ans<<"\n";
}

• Subtask 1: 0 / 2
• Subtask 2: 0 / 2
• Subtask 3: 0 / 4
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 4
• Subtask 7: 0 / 4
• Subtask 8: 0 / 4
• Subtask 9: 0 / 4
• Subtask 10: 0 / 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