Submission #69972

#	Time	Username	Problem	Language	Result	Execution time	Memory
69972		khohko	parentrises (BOI18_parentrises)	C++17	0 / 100	30 ms	17056 KiB

parentrises

#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
#define ll long long
#define pb push_back
#define fr first
#define sc second
#define MAX ((ll)(1e12+100))
#define MX ((ll)(1e6+100))
#define ARRS ((ll)(2e5+100))
#define HS ((ll)(233))
#define MOD ((ll)(1e9+7))
#define EP ((double)(1e-9))
#define LG 21
#define mul(a,b) a=((a)*(b))%MOD
using namespace std;


ll dp[40][300][300];
ll pas[400];
int main(){
	#ifdef KHOKHO
		freopen("in.in","r",stdin);
		freopen("out.out","w",stdout);
	#endif // KHOKHO
	ios::sync_with_stdio(0);
	dp[0][0][100]=1;
	for(int i=1; i<=35; i++){
		pas[i]=0;
		for(int j=0; j<=200; j++){
			for(int k=0; k<=200; k++){

				if(j>=2)
					dp[i][j][k]+=dp[i-1][j-2][k+1];
				if(k>=2)
					dp[i][j][k]+=dp[i-1][j+1][k-2];

				dp[i][j][k]%=MOD;
				if(dp[i][j][k])
				//cout<<i<<" "<<j<<" "<<k<<" "<<dp[i][j][k]<<endl;
				if(k>=101)
					pas[i]+=dp[i][j][k];
			}
		}
		pas[i]%=MOD;
	}
	ll q,n;
	cin>>q>>q;
	while(q--){
		cin>>n;
		cout<<pas[n]<<endl;
	}
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 11
• Subtask 3: 0 / 6
• Subtask 4: 0 / 28
• Subtask 5: 0 / 6
• Subtask 6: 0 / 16
• Subtask 7: 0 / 28