제출 #1170508

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1170508		ZeroCool	Linear Garden (IOI08_linear_garden)	C++20	100 / 100	422 ms	9356 KiB

linear_garden

#include <bits/stdc++.h>
using namespace std;;
#define ll long long
#define ar array
#define ld long double
#define int long long
#define all(v) v.begin(), v.end()

const int N = 2e5 + 20;
const int K = 469;
const int LOG = 26;
const int INF = 1e12;	
int MOD = 998244353;

void mm(int &x){x = (x % MOD + MOD) % MOD;}

void orz(){
	int n;
	cin>>n>>MOD;
	string s;
	cin>>s;
	int A[n];
	for(int i = 0;i < n;i++)A[i] = (s[i] == 'L' ? -1 : 1);
	int dp[2][5][5][5][2];
	memset(dp, 0, sizeof dp);
	dp[0][2][2][2][0] = 1;
	int k = 0;
	for(int i = 0;i < n;i++, k ^= 1){
		memset(dp[k ^ 1], 0, sizeof dp[k ^ 1]);
		for(int mn = 0;mn <= 4;mn++){
			for(int mx = mn;mx <= min(4ll, mn + 2);mx++){
				for(int x = mn;x <= mx;x++){
					for(int u = 0;u < 2;u++){
						for(auto j: {-1, 1}){
							if(!u && j > A[i])continue;
							int nmn = min(mn, x + j);
							int nmx = max(mx, x + j);
							int nx = x + j;
							int nu = u | (j < A[i]);
							if(nmx - nmn > 2 || nmn < 0 || nmx > 4)continue;
							mm(dp[k ^ 1][nmn][nmx][nx][nu] += dp[k][mn][mx][x][u]);
						}
					}
				}
			}
		}
	}
	int ans = 1;
	for(int i = 0;i <= 4;i++){
		for(int j = i;j <= min(4ll, i + 2);j++){
			for(int x = i;x <= j;x++)mm(ans += dp[k][i][j][x][1]);
		}
	}
	cout<<ans;
}	
signed main(){ios_base::sync_with_stdio(false);cin.tie(0);
	int t;
	//cin>>t;
	t = 1;
	while(t--)orz();
}
	

• 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