제출 #132937

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
132937		Mahmoud_Adel	Linear Garden (IOI08_linear_garden)	C++14	0 / 100	72 ms	65540 KiB

linear_garden

#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
typedef long long ll;
const int N = 1e6+5;
int n, mod;
ll dp[N][2][3][3];
string s;
ll sol(int i, int bit, int l, int p)
{
	if(i == n) return 1;
	ll &ret = dp[i][bit][l][p];
	if(ret != -1) return ret;
	ret = 0;
	if(bit)
	{
		if(l < 2) ret += sol(i+1, bit, l+1, max(0, p-1));
		if(p < 2) ret += sol(i+1, bit, max(l-1, 0), p+1), ret %= mod;
	}
	else
	{
		if(s[i] == 'L') ret += sol(i+1, bit, l+1, max(p-1, 0));
		else
		{
			if(l < 2) ret += sol(i+1, 1, l+1, max(p-1, 0));
			ret += sol(i+1, 0, max(0, l-1), p+1), ret %= mod;
		}
	} 
	return ret;
}
int main()
{
	memset(dp, -1, sizeof dp);
	cin >> n >> mod >> s;
	cout << sol(0, 0, 0, 0) << endl;
}

• Subtask 1: 0 / 2
• Subtask 2: 0 / 2
• Subtask 3: 0 / 4
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 4
• Subtask 7: 0 / 4
• Subtask 8: 0 / 4
• Subtask 9: 0 / 4
• Subtask 10: 0 / 4
• Subtask 11: 0 / 4
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5
• Subtask 21: 0 / 5
• Subtask 22: 0 / 5
• Subtask 23: 0 / 5