제출 #163911

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
163911		MvC	캥거루 (CEOI16_kangaroo)	C++11	51 / 100	2043 ms	54136 KiB

kangaroo

//#pragma GCC target("avx2")
//#pragma GCC optimization("O3")
//#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=2e2+50;
const int mod=1e9+7;
using namespace std;
int n,cs,cf,i,l,r,k,f[nmax][nmax][nmax][2];
void ad(int &x,int y)
{
	x+=y;
	if(x>=mod)x-=mod;
}
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n>>cs>>cf;
	f[1][1][1][0]=f[1][1][1][1]=1;
	for(i=2;i<=n;i++)
	{
		for(l=1;l<i;l++)
		{
			for(r=1;r<i;r++)
			{
				for(k=1;k<=i;k++)
				{
					if(k<=r)ad(f[i][l+(k<=l)][k][1],f[i-1][l][r][0]);
					else ad(f[i][l+(k<=l)][k][0],f[i-1][l][r][1]);
				}
			}
		}
	}
	cout<<(f[n][cs][cf][0]+f[n][cs][cf][1])%mod<<endl;
	return 0;
}

• Subtask 1: 6 / 6
• Subtask 2: 30 / 30
• Subtask 3: 15 / 15
• Subtask 4: 0 / 49