QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#336838#8047. DFS Order 4Mine_KingAC ✓1162ms8904kbC++141.1kb2024-02-24 22:10:532024-02-24 22:10:53

Judging History

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

  • [2024-02-24 22:10:53]
  • 评测
  • 测评结果:AC
  • 用时:1162ms
  • 内存:8904kb
  • [2024-02-24 22:10:53]
  • 提交

answer

// 君の人生は月明かりだ、有りがちだなんて言わせるものか
// Think twice, code once.
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
#define eputchar(c) putc(c, stderr)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define eputs(str) fputs(str, stderr), putc('\n', stderr)
using namespace std;

int n, mod, C[805][805], dp[805][805];

int main() {
	scanf("%d%d", &n, &mod);
	for (int i = 0; i <= n; i++)
		for (int j = 0; j <= i; j++)
			if (j == 0 || j == i) C[i][j] = 1;
			else C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % mod;
	for (int i = 0; i <= n; i++) dp[0][i] = dp[1][i] = 1;
	for (int i = 2; i <= n; i++)
		for (int j = 0; j <= n - i; j++) {
			dp[i][j] = (long long)dp[i - 1][0] * C[i + j - 1][i - 1] % mod;
			for (int k = 1; k < i - 1; k++) {
				int res = (long long)dp[k][0] * dp[i - k - 1][j] % mod * C[i + j - 1][k] % mod;
				res = (res + mod - (long long)dp[k][i - k - 1 + j] * dp[i - k - 1][j] % mod) % mod;
				dp[i][j] = (dp[i][j] + res) % mod;
			}
		}
	printf("%d\n", dp[n - 1][0]);
	return 0;
}

这程序好像有点Bug,我给组数据试试?

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 5904kb

input:

4 114514199

output:

2

result:

ok 1 number(s): "2"

Test #2:

score: 0
Accepted
time: 1ms
memory: 5912kb

input:

10 998244353

output:

11033

result:

ok 1 number(s): "11033"

Test #3:

score: 0
Accepted
time: 0ms
memory: 8212kb

input:

100 1000000007

output:

270904395

result:

ok 1 number(s): "270904395"

Test #4:

score: 0
Accepted
time: 948ms
memory: 8680kb

input:

756 1001338769

output:

901942543

result:

ok 1 number(s): "901942543"

Test #5:

score: 0
Accepted
time: 1111ms
memory: 8868kb

input:

793 1009036033

output:

301770320

result:

ok 1 number(s): "301770320"

Test #6:

score: 0
Accepted
time: 964ms
memory: 8692kb

input:

759 1005587659

output:

846376219

result:

ok 1 number(s): "846376219"

Test #7:

score: 0
Accepted
time: 1017ms
memory: 8872kb

input:

773 1007855479

output:

1398019

result:

ok 1 number(s): "1398019"

Test #8:

score: 0
Accepted
time: 941ms
memory: 8760kb

input:

751 1006730639

output:

321287237

result:

ok 1 number(s): "321287237"

Test #9:

score: 0
Accepted
time: 1031ms
memory: 8744kb

input:

778 1007760653

output:

430322899

result:

ok 1 number(s): "430322899"

Test #10:

score: 0
Accepted
time: 1126ms
memory: 8840kb

input:

798 1007543827

output:

688720826

result:

ok 1 number(s): "688720826"

Test #11:

score: 0
Accepted
time: 1104ms
memory: 8904kb

input:

796 1004841413

output:

258829347

result:

ok 1 number(s): "258829347"

Test #12:

score: 0
Accepted
time: 1049ms
memory: 8740kb

input:

775 1005185189

output:

744278608

result:

ok 1 number(s): "744278608"

Test #13:

score: 0
Accepted
time: 1162ms
memory: 8776kb

input:

800 1006012831

output:

508549367

result:

ok 1 number(s): "508549367"

Test #14:

score: 0
Accepted
time: 0ms
memory: 5852kb

input:

1 1001338769

output:

1

result:

ok 1 number(s): "1"

Test #15:

score: 0
Accepted
time: 1ms
memory: 5816kb

input:

2 1001338769

output:

1

result:

ok 1 number(s): "1"

Test #16:

score: 0
Accepted
time: 1ms
memory: 5948kb

input:

9 1009036033

output:

1780

result:

ok 1 number(s): "1780"

Test #17:

score: 0
Accepted
time: 1ms
memory: 5840kb

input:

14 1001338769

output:

43297358

result:

ok 1 number(s): "43297358"

Extra Test:

score: 0
Extra Test Passed