QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#835333	#9561. 树数叔术	Nityacke	100 ✓	948ms	17972kb	C++20	821b	2024-12-28 11:20:34	2024-12-28 11:20:39

Judging History

你现在查看的是最新测评结果

[2024-12-28 11:20:39]
评测

测评结果：100
用时：948ms
内存：17972kb

查看

[2024-12-28 11:20:34]
提交

answer

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=155;
int n,m,H,C[N][N],fac[N],f[N][N][N];
inline void add(int &a,int b){a=(a+b)%H;}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	cin>>n>>m>>H;
	if(m>n) return cout<<"0\n",0; 
	for(int i=0;i<=n;++i){
		C[i][0]=1,fac[i]=i?fac[i-1]*i%H:1;
		for(int j=1;j<=i;++j) C[i][j]=(C[i-1][j-1]+C[i-1][j])%H;
	}
	f[0][1][0]=1;
	for(int i=0;i<m;++i)
		for(int j=1;j<=n;++j)
			for(int k=0;k<=j;++k)
				if(f[i][j][k]){
					if(j>=2){
						for(int V=0;j+V<=n;++V)
							for(int l=0;l<=k;++l)
								if(!(V==0&&l==0)) add(f[i+1][j+V][k-l],f[i][j][k]*C[k][l]%H*C[V+j-2][j-2]);
					}
					add(f[i+1][j+1][k],f[i][j][k]*j),add(f[i+1][j+2][k+1],f[i][j][k]*(j-1));
				}
	cout<<f[m][n][0]*fac[n]%H<<"\n";
}

源文件, 语言: C++20

详细

Subtask #1:

score: 5

Accepted

Test #1:

score: 5

Accepted

time: 0ms

memory: 3672kb

input:

1 1 624295285

output:

result:

ok single line: '0'

Test #2:

score: 5

Accepted

time: 0ms

memory: 3656kb

input:

4 684813415 564954712

output:

result:

ok single line: '0'

Test #3:

score: 5

Accepted

time: 0ms

memory: 3676kb

input:

4 2 844826878

output:

result:

ok single line: '24'

Test #4:

score: 5

Accepted

time: 0ms

memory: 3712kb

input:

4 17724073 252218682

output:

result:

ok single line: '0'

Test #5:

score: 5

Accepted

time: 0ms

memory: 3624kb

input:

4 3 697681963

output:

result:

ok single line: '384'

Subtask #2:

score: 15

Accepted

Test #6:

score: 15

Accepted

time: 0ms

memory: 3704kb

input:

6 4 956647977

output:

result:

ok single line: '238320'

Test #7:

score: 15

Accepted

time: 0ms

memory: 3656kb

input:

6 450615260 491361886

output:

result:

ok single line: '0'

Test #8:

score: 15

Accepted

time: 0ms

memory: 3760kb

input:

6 5 339344353

output:

result:

ok single line: '933120'

Test #9:

score: 15

Accepted

time: 0ms

memory: 3664kb

input:

6 3 842228619

output:

result:

ok single line: '23760'

Test #10:

score: 15

Accepted

time: 1ms

memory: 5792kb

input:

6 5 331699652

output:

result:

ok single line: '933120'

Subtask #3:

score: 30

Accepted

Test #11:

score: 30

Accepted

time: 4ms

memory: 4944kb

input:

48 26 424594716

output:

362283012

result:

ok single line: '362283012'

Test #12:

score: 30

Accepted

time: 0ms

memory: 3652kb

input:

49 1000000000 738885247

output:

result:

ok single line: '0'

Test #13:

score: 30

Accepted

time: 5ms

memory: 7176kb

input:

48 39 688951620

output:

598399200

result:

ok single line: '598399200'

Test #14:

score: 30

Accepted

time: 0ms

memory: 3584kb

input:

50 476039414 292870080

output:

result:

ok single line: '0'

Test #15:

score: 30

Accepted

time: 6ms

memory: 5460kb

input:

50 48 245196368

output:

123576912

result:

ok single line: '123576912'

Subtask #4:

score: 50

Accepted

Test #16:

score: 50

Accepted

time: 0ms

memory: 3648kb

input:

150 526250070 197316869

output:

result:

ok single line: '0'

Test #17:

score: 50

Accepted

time: 910ms

memory: 17020kb

input:

149 116 671784452

output:

18945228

result:

ok single line: '18945228'

Test #18:

score: 50

Accepted

time: 818ms

memory: 17248kb

input:

146 144 906402626

output:

438777234

result:

ok single line: '438777234'

Test #19:

score: 50

Accepted

time: 854ms

memory: 17368kb

input:

147 143 705666477

output:

70408701

result:

ok single line: '70408701'

Test #20:

score: 50

Accepted

time: 948ms

memory: 17972kb

input:

150 147 453481175

output:

336290325

result:

ok single line: '336290325'