/
ioi08_linear.cpp
41 lines (39 loc) · 1.18 KB
/
ioi08_linear.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
#include <cstdio>
#include <algorithm>
using namespace std;
int main(){
int n,m;
char str[1000005];
int dp[2][5][5][2] = {};
scanf("%d %d %s",&n,&m,str);
for (int j=0; j<5; j++) {
for (int k=0; k<5; k++) {
for (int l=0; l<2; l++) {
dp[n&1][j][k][l] = 1;
}
}
}
for (int i=n-1; i>=0; i--) {
for (int j=0; j<5; j++) {
for (int k=0; k<5; k++) {
for (int l=0; l<2; l++) {
if(str[i] == 'L' && !l){
if(k == 4) continue;
dp[i&1][j][k][l] = dp[(i+1)&1][min(2,j+1)][max(3,k+1)][l];
}
else{
dp[i&1][j][k][l] = 0;
if(k != 4){
dp[i&1][j][k][l] += dp[(i+1)&1][min(2,j+1)][max(3,k+1)][1];
}
if(j != 0){
dp[i&1][j][k][l] += dp[(i+1)&1][min(1,j-1)][max(2,k-1)][l];
}
dp[i&1][j][k][l] %= m;
}
}
}
}
}
printf("%d",dp[0][2][2][0]);
}