Submission #1172883

#	Time	Username	Problem	Language	Result	Execution time	Memory
1172883		Dan4Life	Linear Garden (IOI08_linear_garden)	C++20	75 / 100	158 ms	131072 KiB

linear_garden

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)
using ll = long long;
using ar2 = array<ll,2>;
using vi = vector<int>;
const int mxN = (int)1e6+10;
const ll INF = (int)1e9;
int n, MOD;
string s;
 
int dp[mxN][3][2][2];

int recur(int pos, int t, int lst, bool row, bool sm=0){
	if(pos==n) return 1;
	int &res = dp[pos][t][lst][row];
	if(sm and res!=-1) return res;
	int lim = sm?1:s[pos], ans = 0;
	for(int d = 0; d <= lim; d++){
		if((t==d or row) and d==lst) continue;
		
		ans+=recur(pos+1,lst==d?d:t,d,d==lst, sm|(d<lim));
		if(ans>=MOD)ans-=MOD;
	}
	return sm?res=ans:ans;
}
 
int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n >> MOD >> s;
	memset(dp,-1,sizeof(dp));
	for(auto &u:s)u=(u=='L'?0:1);
	cout << recur(0,2,2,0) << "\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: 0 / 5
• Subtask 20: 0 / 5
• Subtask 21: 0 / 5
• Subtask 22: 0 / 5
• Subtask 23: 0 / 5