QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#718455	#9561. 树数叔术	Hunster	100 ✓	447ms	17244kb	C++23	987b	2024-11-06 20:33:43	2024-11-06 20:33:48

Judging History

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

[2024-11-06 20:33:48]
评测

测评结果：100
用时：447ms
内存：17244kb

查看

[2024-11-06 20:33:43]
提交

answer

#include <bits/stdc++.h>

constexpr int N = 152;

int n, v, mod;
int C[N][N], f[N][N][N];

int main() {
    std::cin >> n >> v >> mod;
    for (int i = 0; i <= n; i++) {
        C[i][0] = 1;
        for (int j = 1; j <= i; j++) C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % mod;
    }
    if (v >= n) puts("0");
    else {
        f[0][1][0] = 1;
        for (int i = 1; i <= v; i++)
            for (int j = 1; j <= n; j++)
                for (int k = 0; k <= j; k++) {
                    for (int d = 0; j + d + 1 <= n; d++)
                        f[i][j + d + 1][k + d] = (f[i][j + d + 1][k + d] + 1ll * f[i - 1][j][k] * j) % mod;
                    for (int d = 1; d <= k; d++)
                        f[i][j][k - d] = (f[i][j][k - d] + 1ll * f[i - 1][j][k] * C[k][d]) % mod;
                }
        int ans = f[v][n][0];
        for (int i = 1; i <= n; i++) ans = 1ll * ans * i % mod;
        printf("%d\n", (ans + mod) % mod);
    }
    return 0;
}

源文件, 语言: C++23

詳細信息

Subtask #1:

score: 5

Accepted

Test #1:

score: 5

Accepted

time: 0ms

memory: 3676kb

input:

1 1 624295285

output:

result:

ok single line: '0'

Test #2:

score: 5

Accepted

time: 0ms

memory: 3620kb

input:

4 684813415 564954712

output:

result:

ok single line: '0'

Test #3:

score: 5

Accepted

time: 0ms

memory: 3968kb

input:

4 2 844826878

output:

result:

ok single line: '24'

Test #4:

score: 5

Accepted

time: 0ms

memory: 3636kb

input:

4 17724073 252218682

output:

result:

ok single line: '0'

Test #5:

score: 5

Accepted

time: 0ms

memory: 3912kb

input:

4 3 697681963

output:

result:

ok single line: '384'

Subtask #2:

score: 15

Accepted

Test #6:

score: 15

Accepted

time: 0ms

memory: 3840kb

input:

6 4 956647977

output:

result:

ok single line: '238320'

Test #7:

score: 15

Accepted

time: 0ms

memory: 3624kb

input:

6 450615260 491361886

output:

result:

ok single line: '0'

Test #8:

score: 15

Accepted

time: 0ms

memory: 3992kb

input:

6 5 339344353

output:

result:

ok single line: '933120'

Test #9:

score: 15

Accepted

time: 0ms

memory: 3836kb

input:

6 3 842228619

output:

result:

ok single line: '23760'

Test #10:

score: 15

Accepted

time: 0ms

memory: 3932kb

input:

6 5 331699652

output:

result:

ok single line: '933120'

Subtask #3:

score: 30

Accepted

Test #11:

score: 30

Accepted

time: 0ms

memory: 4672kb

input:

48 26 424594716

output:

362283012

result:

ok single line: '362283012'

Test #12:

score: 30

Accepted

time: 0ms

memory: 3568kb

input:

49 1000000000 738885247

output:

result:

ok single line: '0'

Test #13:

score: 30

Accepted

time: 3ms

memory: 5168kb

input:

48 39 688951620

output:

598399200

result:

ok single line: '598399200'

Test #14:

score: 30

Accepted

time: 0ms

memory: 3668kb

input:

50 476039414 292870080

output:

result:

ok single line: '0'

Test #15:

score: 30

Accepted

time: 0ms

memory: 5368kb

input:

50 48 245196368

output:

123576912

result:

ok single line: '123576912'

Subtask #4:

score: 50

Accepted

Test #16:

score: 50

Accepted

time: 0ms

memory: 3724kb

input:

150 526250070 197316869

output:

result:

ok single line: '0'

Test #17:

score: 50

Accepted

time: 382ms

memory: 14324kb

input:

149 116 671784452

output:

18945228

result:

ok single line: '18945228'

Test #18:

score: 50

Accepted

time: 433ms

memory: 16976kb

input:

146 144 906402626

output:

438777234

result:

ok single line: '438777234'

Test #19:

score: 50

Accepted

time: 447ms

memory: 16756kb

input:

147 143 705666477

output:

70408701

result:

ok single line: '70408701'

Test #20:

score: 50

Accepted

time: 443ms

memory: 17244kb

input:

150 147 453481175

output:

336290325

result:

ok single line: '336290325'