Submission #1338287

#	Time	Username	Problem	Language	Result	Execution time	Memory
1338287		charlestitititit	Linear Garden (IOI08_linear_garden)	C++20	0 / 100	39 ms	36392 KiB

linear_garden

#include <bits/stdc++.h>
//#define int long long

using namespace std;

int dp[1000069][3][3];
char s[1000069];

signed main(){

    cin.tie(0); ios::sync_with_stdio(0);

    int n, M; cin >> n >> M;
    for(int i=1; i<=n; i++) cin >> s[i];
//    memset(dp[0], 1, sizeof dp[0]);
    for(int i=0; i<=n; i++)for(int j=0; j<=2; j++) for(int k=0; k<=2; k++){
        if(i==0) {dp[0][j][k] = 1; continue; }
        dp[i][j][k] = dp[i-1][j+1][max(k-1,0)] + dp[i-1][max(0,j-1)][k+1];
        dp[i][j][k] % M;
    }

    int j=0, k=0;
    int cnt = 1;

    for(int i=1; i<=n; i++){
//        cout << s[i] << "A\n";
        if(s[i] == 'L'){
            j--, k++; j=max(0,j); continue;
        }
        else{
            cnt += dp[n-i+1][max(0, j-1)][k+1];
            cnt %= M;
            j++, k--; k = max(0, k);
        }
    }

    cout << cnt;


    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