제출 #219500

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

linear_garden

#include <bits/stdc++.h>
 
using namespace std;
 
const int kN = 1e6 + 3;
 
int n, m;
string garden;
 
int dp[kN][6][5];
bool dp_solved[kN][6][5];

bool illegal[1 << 5];
int new_idx_mask[1 << 5];
 
int get_count(int pos, int mask, int diff){
	if(diff < 0 || diff > 4)
		return 0;
	mask |= 1 << diff;
	if(illegal[mask])
		return 0;
	if(pos == n)
		return 1;
 
	int &ans = dp[pos][new_idx_mask[mask]][diff];
	bool &solved = dp_solved[pos][new_idx_mask[mask]][diff];
	if(solved)
		return ans;
 
	solved = true;
	ans = 0;
 
	ans += get_count(pos + 1, mask, diff + 1);
	ans += get_count(pos + 1, mask, diff - 1);
	while(ans >= m)
		ans -= m;
 
	return ans;
}
 
int main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
 
	cin >> n >> m >> garden;
 
	illegal[(1 << 2)] = true;
	illegal[(1 << 2) + (1 << 1)] = true;
	illegal[(1 << 2) + (1 << 1) + (1 << 0)] = true;
	illegal[(1 << 2) + (1 << 1) + (1 << 3)] = true;
	illegal[(1 << 2) + (1 << 3) + (1 << 4)] = true;
	illegal[(1 << 2) + (1 << 3)] = true;

	for(int i = 0; i < (1 << 5); ++i)
		illegal[i] = !illegal[i];

	new_idx_mask[0] = 0;
	for(int i = 1; i < (1 << 5); ++i){
		if(illegal[i])
			new_idx_mask[i] = new_idx_mask[i - 1];
		else
			new_idx_mask[i] = new_idx_mask[i - 1] + 1;
	}
 
	int ans = 1;
	int mask = (1 << 2), diff = 2;
	for(int i = 0; i < n; ++i){
		if(garden[i] == 'P'){
			ans += get_count(i + 1, mask, diff - 1);
			while(ans >= m)
				ans -= m;
		}
		if(garden[i] == 'L'){
			mask |= 1 << (diff - 1);
			diff -= 1;
		}
		else{
			mask |= 1 << (diff + 1);
			diff += 1;
		}
	}
 
	cout << ans << "\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