Submission #1004773

#	Time	Username	Problem	Language	Result	Execution time	Memory
1004773		12345678	Linear Garden (IOI08_linear_garden)	C++17	95 / 100	12 ms	25848 KiB

linear_garden

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=1e6+5;

ll n, m, dp[3][nx], res, cnt, mx, mn;
string s;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n>>m>>s;
    dp[0][0]=dp[1][0]=dp[2][0]=1;
    for (int i=1; i<=n; i++)
    {
        dp[0][i]=dp[1][i-1];
        dp[1][i]=(dp[0][i-1]+dp[2][i-1])%m;
        dp[2][i]=dp[1][i-1];
        //cout<<"count "<<i<<' '<<dp[0][i]+dp[1][i]+dp[2][i]-2<<'\n';
    }
    for (int i=0; i<n; i++)
    {
        if (s[i]=='P')
        {
            ll tmp=cnt;
            tmp++;
            ll nmx=max(mx,tmp), nmn=mn, t=0;
            if (nmx-nmn<=2)
            {
                if (max(tmp+1, nmx)-min(tmp-1, nmn)<=2) res=(res+dp[1][n-i-1])%m, t++;
                if (tmp==nmx) res=(res+dp[2][n-i-1])%m, t++;
            }
            if (t==2) res--;
        }
        if (s[i]=='P') cnt--;
        else cnt++;
        mx=max(mx, cnt);
        mn=min(mn, cnt);
    }
    cout<<res+1;
}

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