QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#741946	#9561. 树数叔术	wullaaa	100 ✓	56ms	17632kb	C++14	997b	2024-11-13 15:31:26	2024-11-13 15:31:36

Judging History

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

[2024-11-13 15:31:36]
评测

测评结果：100
用时：56ms
内存：17632kb

查看

[2024-11-13 15:31:26]
提交

answer

#include<bits/stdc++.h>
using namespace std;
const int N=155;
int n,v,MOD;
void add(int &x,int y){ x+=y; if(x>=MOD) x-=MOD; if(x<0) x+=MOD; }
int ad(int x,int y){ x+=y; if(x>=MOD) x-=MOD; if(x<0) x+=MOD; return x; }
int power(int x,int y){
    int ans=1;
    for(;y;y>>=1,x=1ll*x*x%MOD) if(y&1) ans=1ll*ans*x%MOD;
    return ans;
}
int dp[N][N/*后面还有多少种颜色会被放到树中*/][N/*当前树大小*/];
int main(){
    scanf("%d%d%d",&n,&v,&MOD);
    if(v>=n) return puts("0"),0;
    for(int i=0;i<v;++i) dp[0][i][1]=1;
    for(int now=1;now<=v;++now)
        for(int i=0;i<v;++i)
            for(int j=1,s=0;j<=n;++j){
                if(i) add(dp[now][i-1][j],dp[now-1][i][j]);
                add(dp[now][i][j],-dp[now-1][i][j]);
                add(dp[now][i][j],s);
                s=ad(1ll*s*i%MOD,1ll*dp[now-1][i][j]*j%MOD);
            }
    int ans=dp[v][0][n];
    for(int i=1;i<=n;++i) ans=1ll*ans*i%MOD;
    printf("%d\n",ans);
    return 0;
}

源文件, 语言: C++14

詳細信息

Subtask #1:

score: 5

Accepted

Test #1:

score: 5

Accepted

time: 0ms

memory: 3808kb

input:

1 1 624295285

output:

result:

ok single line: '0'

Test #2:

score: 5

Accepted

time: 0ms

memory: 3812kb

input:

4 684813415 564954712

output:

result:

ok single line: '0'

Test #3:

score: 5

Accepted

time: 0ms

memory: 3880kb

input:

4 2 844826878

output:

result:

ok single line: '24'

Test #4:

score: 5

Accepted

time: 0ms

memory: 3824kb

input:

4 17724073 252218682

output:

result:

ok single line: '0'

Test #5:

score: 5

Accepted

time: 0ms

memory: 3828kb

input:

4 3 697681963

output:

result:

ok single line: '384'

Subtask #2:

score: 15

Accepted

Test #6:

score: 15

Accepted

time: 0ms

memory: 3904kb

input:

6 4 956647977

output:

result:

ok single line: '238320'

Test #7:

score: 15

Accepted

time: 0ms

memory: 3820kb

input:

6 450615260 491361886

output:

result:

ok single line: '0'

Test #8:

score: 15

Accepted

time: 0ms

memory: 3796kb

input:

6 5 339344353

output:

result:

ok single line: '933120'

Test #9:

score: 15

Accepted

time: 0ms

memory: 3748kb

input:

6 3 842228619

output:

result:

ok single line: '23760'

Test #10:

score: 15

Accepted

time: 0ms

memory: 3828kb

input:

6 5 331699652

output:

result:

ok single line: '933120'

Subtask #3:

score: 30

Accepted

Test #11:

score: 30

Accepted

time: 1ms

memory: 4384kb

input:

48 26 424594716

output:

362283012

result:

ok single line: '362283012'

Test #12:

score: 30

Accepted

time: 0ms

memory: 3796kb

input:

49 1000000000 738885247

output:

result:

ok single line: '0'

Test #13:

score: 30

Accepted

time: 2ms

memory: 4948kb

input:

48 39 688951620

output:

598399200

result:

ok single line: '598399200'

Test #14:

score: 30

Accepted

time: 0ms

memory: 3684kb

input:

50 476039414 292870080

output:

result:

ok single line: '0'

Test #15:

score: 30

Accepted

time: 0ms

memory: 5544kb

input:

50 48 245196368

output:

123576912

result:

ok single line: '123576912'

Subtask #4:

score: 50

Accepted

Test #16:

score: 50

Accepted

time: 0ms

memory: 3608kb

input:

150 526250070 197316869

output:

result:

ok single line: '0'

Test #17:

score: 50

Accepted

time: 24ms

memory: 12472kb

input:

149 116 671784452

output:

18945228

result:

ok single line: '18945228'

Test #18:

score: 50

Accepted

time: 44ms

memory: 17164kb

input:

146 144 906402626

output:

438777234

result:

ok single line: '438777234'

Test #19:

score: 50

Accepted

time: 56ms

memory: 16844kb

input:

147 143 705666477

output:

70408701

result:

ok single line: '70408701'

Test #20:

score: 50

Accepted

time: 52ms

memory: 17632kb

input:

150 147 453481175

output:

336290325

result:

ok single line: '336290325'