제출 #805101

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
805101		BidoTeima	Linear Garden (IOI08_linear_garden)	C++17	0 / 100	65 ms	65536 KiB

linear_garden

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N = 1e6 + 3;
int mod;
int n;
int a[N];
int dp[2][2][2][N];
int rec(int idx, int p1, int p2, bool less){
    if(idx == n){
        return 1;
    } 
    assert(a[idx]==0||a[idx]==1);
    if(p1!=-1&&p2!=-1&&dp[p1][p2][less][idx]!=-1){
        return dp[p1][p2][less][idx];
    }
    int ret = 0;
    if(p1==-1||p2==-1||p1!=p2){
        for(int i = 0; less? i <= 1 : i <= a[idx]; i++){
            assert(i!=2);
            ret += rec(idx+1,i,p1,less||(i<a[idx]));
        }
    } else if(p1 == 0){
        if(a[idx]==1||less)ret+=rec(idx+1,1,p1,less);
    }
    else{
        ret+=rec(idx+1,0,p1,less||a[idx]);
    }
    ret%=mod;
    if(p1!=-1&&p2!=-1){
        dp[p1][p2][less][idx]=ret;
    }
    return ret;
}
int main()
{
    memset(dp,-1,sizeof(dp));
    cin>>n>>mod;
    for(int i = 0; i < n; i++){
        char ch;
        cin>>ch;
        a[i]=ch=='P';
    }
    cout<<(rec(0,-1,-1,0)-1+mod)%mod;
    return 0;
}

• 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