QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #700312 | #9561. 树数叔术 | C1942huangjiaxu | 100 ✓ | 62ms | 4304kb | C++14 | 879b | 2024-11-02 12:41:38 | 2024-11-02 12:41:44 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N=155;
struct Fastmod{
typedef unsigned long long ull;
typedef __uint128_t uLL;
ull P,m;
void init(int P){
this->P=P,m=(uLL(1)<<64)/P;
}
ull mod(ull a){
ull b=uLL(m)*a>>64;
ull r=a-b*P;
return r>=P?r-P:r;
}
}Z;
int f[N][N],C[N][N],n,V,P,ans;
int main(){
scanf("%d%d%d",&n,&V,&P);
if(V>=n)return puts("0"),0;
Z.init(P);
for(int i=0;i<=n;++i)C[i][0]=1;
for(int i=1;i<=n;++i)for(int j=1;j<=i;++j)C[i][j]=Z.mod(C[i-1][j]+C[i-1][j-1]);
f[1][0]=1;
for(int t=1;t<=V;++t)
for(int i=n;i;--i)for(int j=0;j<i;++j)if(f[i][j]){
for(int l=0;l+i+1<=n;++l)f[i+l+1][j+l]=Z.mod(f[i+l+1][j+l]+1ull*f[i][j]*i);
for(int l=1;l<=j;++l)f[i][j-l]=Z.mod(f[i][j-l]+1ull*f[i][j]*C[j][l]);
f[i][j]=0;
}
ans=f[n][0];
for(int i=1;i<=n;++i)ans=Z.mod(1ull*ans*i);
printf("%d\n",ans);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 5
Accepted
Test #1:
score: 5
Accepted
time: 0ms
memory: 3756kb
input:
1 1 624295285
output:
0
result:
ok single line: '0'
Test #2:
score: 5
Accepted
time: 0ms
memory: 3636kb
input:
4 684813415 564954712
output:
0
result:
ok single line: '0'
Test #3:
score: 5
Accepted
time: 0ms
memory: 3824kb
input:
4 2 844826878
output:
24
result:
ok single line: '24'
Test #4:
score: 5
Accepted
time: 0ms
memory: 3628kb
input:
4 17724073 252218682
output:
0
result:
ok single line: '0'
Test #5:
score: 5
Accepted
time: 0ms
memory: 4092kb
input:
4 3 697681963
output:
384
result:
ok single line: '384'
Subtask #2:
score: 15
Accepted
Test #6:
score: 15
Accepted
time: 0ms
memory: 3824kb
input:
6 4 956647977
output:
238320
result:
ok single line: '238320'
Test #7:
score: 15
Accepted
time: 0ms
memory: 3984kb
input:
6 450615260 491361886
output:
0
result:
ok single line: '0'
Test #8:
score: 15
Accepted
time: 0ms
memory: 3824kb
input:
6 5 339344353
output:
933120
result:
ok single line: '933120'
Test #9:
score: 15
Accepted
time: 0ms
memory: 4124kb
input:
6 3 842228619
output:
23760
result:
ok single line: '23760'
Test #10:
score: 15
Accepted
time: 0ms
memory: 3864kb
input:
6 5 331699652
output:
933120
result:
ok single line: '933120'
Subtask #3:
score: 30
Accepted
Test #11:
score: 30
Accepted
time: 0ms
memory: 3856kb
input:
48 26 424594716
output:
362283012
result:
ok single line: '362283012'
Test #12:
score: 30
Accepted
time: 0ms
memory: 3952kb
input:
49 1000000000 738885247
output:
0
result:
ok single line: '0'
Test #13:
score: 30
Accepted
time: 1ms
memory: 3964kb
input:
48 39 688951620
output:
598399200
result:
ok single line: '598399200'
Test #14:
score: 30
Accepted
time: 0ms
memory: 3660kb
input:
50 476039414 292870080
output:
0
result:
ok single line: '0'
Test #15:
score: 30
Accepted
time: 0ms
memory: 3888kb
input:
50 48 245196368
output:
123576912
result:
ok single line: '123576912'
Subtask #4:
score: 50
Accepted
Test #16:
score: 50
Accepted
time: 0ms
memory: 3988kb
input:
150 526250070 197316869
output:
0
result:
ok single line: '0'
Test #17:
score: 50
Accepted
time: 60ms
memory: 4304kb
input:
149 116 671784452
output:
18945228
result:
ok single line: '18945228'
Test #18:
score: 50
Accepted
time: 55ms
memory: 3956kb
input:
146 144 906402626
output:
438777234
result:
ok single line: '438777234'
Test #19:
score: 50
Accepted
time: 57ms
memory: 3996kb
input:
147 143 705666477
output:
70408701
result:
ok single line: '70408701'
Test #20:
score: 50
Accepted
time: 62ms
memory: 4300kb
input:
150 147 453481175
output:
336290325
result:
ok single line: '336290325'