Submission #102260

#	Time	Username	Problem	Language	Result	Execution time	Memory
102260		TAMREF	Linear Garden (IOI08_linear_garden)	C++11	100 / 100	203 ms	4380 KiB

linear_garden

#include <bits/stdc++.h>
using namespace std;
int d[2][32];
unsigned char bi[1000005], ci[1000005];
int n, m;
int ans = 1;
string S;

void add(int &x, int y){
    x = (x + y) % m;
}

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin >> n >> m >> S;
    for(int i = 1; i <= n; i++){
        if(S[i-1] == 'L'){
            bi[i] = bi[i-1] << 1 | 8;
        }else{
            bi[i] = bi[i-1] >> 1 | 2;
            ci[i] = bi[i-1] << 1 | 8;
        }
    }
    for(int i = 0; i < 32; i++) d[0][i] = 1;
    if(S[n-1] == 'P' && ci[n] < 32) add(ans, 1);

    for(int i = 1, w = 1; i < n; i++, w = !w){
        for(int b = 0; b < 32; b++) d[w][b] = 0;
        for(int b = 0; b < 32; b++){
            if((b & 1) == 0){
                add(d[w][b], d[!w][b >> 1 | 2]);
            }
            if((b & 16) == 0){
                add(d[w][b], d[!w][b << 1 | 8]);
            }
        }
        if(S[n-1-i] == 'P' && ci[n-i] < 32) add(ans, d[w][ci[n-i]]);
    }

    cout << ans << '\n';
}

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