제출 #262839

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
262839		amiratou	Linear Garden (IOI08_linear_garden)	C++14	40 / 100	1596 ms	2716 KiB

linear_garden

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define rando mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define fi first
#define se second
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define debugii(x) cerr << " - " << #x << ": " << x.fi<<","<<x.se << endl;
#define sep() cerr << "--------------------" << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ld long double
#define ll long long
//#define int ll
#define ii pair<int,int>
#define v vector<int>
#define vii vector<ii>
#define vv vector<vector<int> >
#define mp make_pair
#define INF 1000000000
#define pb push_back
#define EPS 1e-9
const int MOD = 1000000007; // 998244353
string p="",S;
int n,m;
vector<string> vec;
int cum[500],sum;
void solve(int idx){
	/*cerr<<idx<<" "<<a<<" "<<b<<" "<<cnt<<"\n";
	cerr<<p<<"\n";*/
	for (int i = 0; i < sz(p); ++i)
		if(abs(cum[idx-1]-(i?cum[i-1]:0))>2)return;
	if(idx==n){
		if(p==S){cout<<(sum+1)%m<<"\n";exit(0);}
		sum++;
		return ;
	}
	cum[idx]=1,p.pb('L');
	if(idx)cum[idx]+=cum[idx-1];
	solve(idx+1),p.pop_back();
	cum[idx]=-1,p.pb('P');
	if(idx)cum[idx]+=cum[idx-1];
	solve(idx+1),p.pop_back();
}
int32_t main(){
	boost;
	//freopen(".in","r",stdin);
	cin>>n>>m>>S;
	solve(0);
	return 0;
}

//do smth instead of nothing and stay organized
//long long
//array bounds
//special cases
//binary search

• 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: 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