Submission #2540924


Source Code Expand

Copy
#include<stdio.h>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<bitset>
#include<utility>
#include<functional>
#include<iomanip>
#include<sstream>
#include<ctime>
#include<cassert>
using namespace std;
#define y0 y0z
#define y1 y1z
#define yn ynz
#define j0 j0z
#define j1 j1z
#define jn jnz
#define tm tmz
#define buli(x) (__builtin_popcountll(x))
#define bur0(x) (__builtin_ctzll(x))
#define bul2(x) (63-__builtin_clzll(x))
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fil(a,b) memset((a),(b),sizeof(a))
#define cl(a) fil(a,0)
#define siz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define rep(i,a,b) for (int i=(a),_ed=(b);i<_ed;i++)
#define per(i,a,b) for (int i=(b)-1,_ed=(a);i>=_ed;i--)
#define forg(i,gu) for (int i=gu;~i;i=e[i].next)
#define pw(x) ((ll(1))<<(x))
#define upmo(a,b) (((a)=((a)+(b))%mo)<0?(a)+=mo:(a))
#define mmo(a,b) (((a)=1ll*(a)*(b)%mo)<0?(a)+=mo:(a))
void getre(){int x=0;printf("%d\n",1/x);}
void gettle(){int res=1;while(1)res<<=1;printf("%d\n",res);}
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
template<typename T,typename S>inline bool upmin(T&a,const S&b){return a>b?a=b,1:0;}
template<typename T,typename S>inline bool upmax(T&a,const S&b){return a<b?a=b,1:0;}
template<typename N,typename PN>inline N flo(N a,PN b){return a>=0?a/b:-((-a-1)/b)-1;}
template<typename N,typename PN>inline N cei(N a,PN b){return a>0?(a-1)/b+1:-(-a/b);}
template<typename N>N gcd(N a,N b){return b?gcd(b,a%b):a;}
template<typename N>inline int sgn(N a){return a>0?1:(a<0?-1:0);}
#if ( ( _WIN32 || __WIN32__ ) && __cplusplus < 201103L)
#define lld "%I64d"
#else
#define lld "%lld"
#endif
inline void gn(long long&x){
	int sg=1;char c;while(((c=getchar())<'0'||c>'9')&&c!='-');
	c=='-'?(sg=-1,x=0):(x=c-'0');
	while((c=getchar())>='0'&&c<='9')x=x*10+c-'0';x*=sg;
}
inline void gn(int&x){long long t;gn(t);x=t;}
inline void gn(unsigned long long&x){long long t;gn(t);x=t;}
inline void gn(double&x){double t;scanf("%lf",&t);x=t;}
inline void gn(long double&x){double t;scanf("%lf",&t);x=t;}
inline void gs(char *s){scanf("%s",s);}
inline void gc(char &c){while((c=getchar())>126 || c<33);}
inline void pc(char c){putchar(c);}
#ifdef JCVB
#define debug(...) fprintf(stderr, __VA_ARGS__)
#else
#define debug(...)
#endif
typedef long long ll;
typedef double db;
inline ll sqr(ll a){return a*a;}
inline db sqrf(db a){return a*a;}
const int inf=0x3f3f3f3f;
//const ll inf=0x3f3f3f3f3f3f3f3fll;
const db pi=3.14159265358979323846264338327950288L;
const db eps=1e-6;
int mo=0;
int qp(int a,ll b){int n=1;do{if(b&1)n=1ll*n*a%mo;a=1ll*a*a%mo;}while(b>>=1);return n;}

int n,k;
int c[333][333];
int f[333][333];
int g[333][333];
int main()
{
	gn(n);gn(k);gn(mo);
	c[0][0]=1;
	rep(i,1,322){
		c[i][0]=1;
		rep(j,1,i+1)c[i][j]=(c[i-1][j-1]+c[i-1][j])%mo;
	}
	rep(i,0,k+1)f[0][i]=1;
	rep(i,1,n+1) {
		g[i][1]=f[i-1][0];
		rep(j,2,k+1) {
			g[i][j]=(g[i][j-1]+f[i-1][j-1])%mo;
		}
		rep(j,1,k+1) {
			rep(d,1,i+1) {
				upmo(f[i][j],1ll*g[d][j]*f[i-d][j]%mo*c[i-1][d-1]);
			}
		}
	}
	printf("%d\n",f[n][k]);
	return 0;
}

Submission Info

Submission Time
Task E - Sequence Growing Hard
User jcvb
Language C++14 (GCC 5.4.1)
Score 1200
Code Size 3420 Byte
Status
Exec Time 352 ms
Memory 1408 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 s1.txt, s2.txt, s3.txt
All 1200 / 1200 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt 352 ms 1408 KB
02.txt 307 ms 1408 KB
03.txt 198 ms 1280 KB
04.txt 1 ms 640 KB
05.txt 340 ms 1408 KB
06.txt 3 ms 1408 KB
07.txt 1 ms 640 KB
08.txt 337 ms 1408 KB
09.txt 327 ms 1408 KB
10.txt 189 ms 1280 KB
11.txt 130 ms 1280 KB
12.txt 1 ms 640 KB
13.txt 1 ms 640 KB
14.txt 352 ms 1408 KB
15.txt 33 ms 1408 KB
16.txt 231 ms 1408 KB
17.txt 2 ms 768 KB
18.txt 267 ms 1408 KB
19.txt 340 ms 1408 KB
20.txt 72 ms 1280 KB
21.txt 3 ms 1408 KB
22.txt 269 ms 1408 KB
23.txt 305 ms 1408 KB
24.txt 3 ms 768 KB
25.txt 9 ms 768 KB
26.txt 296 ms 1408 KB
27.txt 6 ms 768 KB
28.txt 59 ms 1408 KB
29.txt 244 ms 1408 KB
30.txt 9 ms 896 KB
31.txt 294 ms 1408 KB
32.txt 348 ms 1408 KB
s1.txt 1 ms 640 KB
s2.txt 1 ms 640 KB
s3.txt 43 ms 1024 KB