oj.uz

Submission #896729

# Submission time Handle Problem Language Result Execution time Memory
896729 2024-01-02T02:27:00 Z LCJLY Linear Garden (IOI08_linear_garden) C++14
100 / 100
 105 ms 10232 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl; 
#define show4(x,y) for(auto it:x) cout << it << " "; cout << #y << endl;
typedef pair<int,int>pii;
typedef pair<pii,pii>pi2;

int n,mod;
int arr[1000005];
//vector<int>memo[3][3][2];

//int dp(int index, int lotus, int pap, bool bound){
	//if(index==n) return 1;
	//if(memo[lotus][pap][bound][index]!=-1) return memo[lotus][pap][bound][index];
	//int ans=0;
	
	//if(bound){
		//for(int x=1;x<=arr[index];x++){
			//int hold=lotus;
			//int hold2=pap;
			//if(x==1){
				//hold++;
				//hold2=max(0LL,hold2-1);
			//}
			//else{
				//hold2++;
				//hold=max(0LL,hold-1);
			//}
			
			//if(hold>2||hold2>2) continue;
			//ans=(ans+dp(index+1,hold,hold2,x==arr[index]))%mod;
		//}
	//}
	//else{
		//for(int x=1;x<=2;x++){
			//int hold=lotus;
			//int hold2=pap;
			//if(x==1){
				//hold++;
				//hold2=max(0LL,hold2-1);
			//}
			//else{
				//hold2++;
				//hold=max(0LL,hold-1);
			//}
			
			//if(hold>2||hold2>2) continue;
			//ans=(ans+dp(index+1,hold,hold2,false))%mod;
		//}
	//}
	//return memo[lotus][pap][bound][index]=ans;
//}

void solve(){	
	cin >> n >> mod;
	
	string s;
	cin >> s;
	
	for(int x=0;x<n;x++){
		if(s[x]=='L') arr[x]=1;
		else arr[x]=2;
	}
	
	int dp[2][3][3][2];
	memset(dp,0,sizeof(dp));
	dp[0][0][0][1]=1;
	int counter=0;
	for(int index=0;index<=n;index++){
		for(int lotus=0;lotus<3;lotus++){
			for(int pap=0;pap<3;pap++){
				for(int bound=0;bound<2;bound++){
					if(index==n){
						counter=(counter+dp[0][lotus][pap][bound])%mod;
						continue;
					}
					if(bound){
						for(int x=1;x<=arr[index];x++){
							int hold=lotus;
							int hold2=pap;
							if(x==1){
								hold++;
								hold2=max(0LL,hold2-1);
							}
							else{
								hold2++;
								hold=max(0LL,hold-1);
							}
							if(hold>2||hold2>2) continue;
							dp[1][hold][hold2][(x==arr[index])]=(dp[1][hold][hold2][(x==arr[index])]+dp[0][lotus][pap][bound])%mod;
						}
					}
					else{
						for(int x=1;x<=2;x++){
							int hold=lotus;
							int hold2=pap;
							if(x==1){
								hold++;
								hold2=max(0LL,hold2-1);
							}
							else{
								hold2++;
								hold=max(0LL,hold-1);
							}
							if(hold>2||hold2>2) continue;
							dp[1][hold][hold2][0]=(dp[1][hold][hold2][0]+dp[0][lotus][pap][bound])%mod;
						}
					}
				}
			}
		}
		
		for(int lotus=0;lotus<3;lotus++){
			for(int pap=0;pap<3;pap++){
				for(int bound=0;bound<2;bound++){
					dp[0][lotus][pap][bound]=dp[1][lotus][pap][bound];
					dp[1][lotus][pap][bound]=0;
				}
			}
		}
	}
	
	cout << counter;
}

int32_t main(){										
	ios::sync_with_stdio(0);	
	cin.tie(0);
	//freopen("out.txt", "w", stdout);
	int t=1;
	//cin >> t;
	while(t--){
		solve();
	}	
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 504 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #7
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #8
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #9
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #10
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #11
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 604 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2652 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 2904 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 5360 KB Output is correct

Subtask #20
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 5612 KB Output is correct

Subtask #21
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 5872 KB Output is correct

Subtask #22
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 8180 KB Output is correct

Subtask #23
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 10232 KB Output is correct
2 Correct 105 ms 10232 KB Output is correct
3 Correct 105 ms 10232 KB Output is correct