Submission #691002

#	Time	Username	Problem	Language	Result	Execution time	Memory
691002		Ahmed57	Linear Garden (IOI08_linear_garden)	C++14	75 / 100	148 ms	65536 KiB

linear_garden

#include <bits/stdc++.h>

using namespace std;
long long dp[100001][5][3][3];
long long n,m;
long long solve(int i,int cnt,int ma,int mi){
    if(i==n){
        return 1;
    }
    if(dp[i][cnt][ma][mi]!=-1)return dp[i][cnt][ma][mi];
    long long c1 = 0;
    {
        int ne = cnt+1;
        int r = 2+ma;
        int l = 2-mi;
        if(abs(ne-r)<=2&&abs(ne-l)<=2){
            int nma = max(ma,ne-2);
            int nmi = max(mi,2-ne);
            c1+=solve(i+1,ne,nma,nmi);
            c1%=m;
        }
    }
    {
        int ne = cnt-1;
        int r = 2+ma;
        int l = 2-mi;
        if(abs(ne-r)<=2&&abs(ne-l)<=2){
            int nma = max(ma,ne-2);
            int nmi = max(mi,2-ne);
            c1+=solve(i+1,ne,nma,nmi);
            c1%=m;
        }
    }
    return dp[i][cnt][ma][mi] = c1;
}
int main(){
    cin>>n>>m;
    string s;cin>>s;
    memset(dp,-1,sizeof dp);
    int cnt = 2;
    long long num = 1 ;
    int ma =0  , mi = 0;
    for(int i = 0;i<s.size();i++){
        if(s[i]=='P'){
            int ne = cnt-1;
            int r = 2+ma;
            int l = 2-mi;
            if(abs(ne-r)<=2&&abs(ne-l)<=2){
                int nma = max(ma,ne-2);
                int nmi = max(mi,2-ne);
                num+=solve(i+1,ne,nma,nmi);
                num%=m;
            }
        }
        if(s[i]=='P')cnt++;
        else cnt--;
        ma = max(ma,cnt-2);
        mi = max(mi,2-cnt);
    }
    cout<<num<<"\n";
}

Compilation message (stderr)

linear_garden.cpp: In function 'int main()':
linear_garden.cpp:43:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |     for(int i = 0;i<s.size();i++){
      |                   ~^~~~~~~~~

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