답안 #786762

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
786762	2023-07-18T12:36:57 Z	flappybird	NoM (RMI21_nom)	C++17	100 / 100	171 ms	78208 KB

Main

#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define MAX 2020
#define MAXS 22
#define INF 1000000000000000001
#define bb ' '
#define ln '\n'
#define Ln '\n'
#define MOD 1000000007
ll fact[MAX * 2];
int A[MAX];
ll dp[2][MAX * 2];
ll C[MAX * 2][MAX * 2];
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int N, M;
	cin >> N >> M;
	int i, j, k;
	fact[0] = 1;
	for (i = 1; i <= N * 2; i++) fact[i] = (fact[i - 1] * i) % MOD;
	C[0][0] = 1;
	for (i = 1; i <= N * 2; i++) {
		C[i][0] = C[i][i] = 1;
		for (j = 1; j < i; j++) C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD;
	}
	for (i = 1; i <= N * 2; i++) A[i % M]++;
	dp[0][A[0]] = 1;
	int sum = A[0];
	for (i = 1; i < M; ++i) {
		for (j = 0; j <= sum; j++) dp[i & 1][j] = 0;
		for (j = 0; j <= sum; ++j) for (k = 0; k <= j && k <= A[i]; ++k) dp[i & 1][j + A[i] - k * 2] = (dp[i & 1][j + A[i] - k * 2] + dp[(i ^ 1) & 1][j] * ((C[A[i]][k] * ((C[j][k] * fact[k]) % MOD)) % MOD)) % MOD;
		sum += A[i];
	}
	ll ans = (dp[(M & 1) ^ 1][0] * fact[N]) % MOD;
	for (i = 1; i <= N; i++) {
		ans <<= 1;
		ans %= MOD;
	}
	cout << ans;
}

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	1236 KB	Output is correct
12	Correct	1 ms	852 KB	Output is correct
13	Correct	1 ms	852 KB	Output is correct
14	Correct	1 ms	852 KB	Output is correct
15	Correct	1 ms	980 KB	Output is correct
16	Correct	1 ms	1108 KB	Output is correct
17	Correct	1 ms	852 KB	Output is correct
18	Correct	1 ms	852 KB	Output is correct
19	Correct	1 ms	1108 KB	Output is correct

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	1236 KB	Output is correct
12	Correct	1 ms	852 KB	Output is correct
13	Correct	1 ms	852 KB	Output is correct
14	Correct	1 ms	852 KB	Output is correct
15	Correct	1 ms	980 KB	Output is correct
16	Correct	1 ms	1108 KB	Output is correct
17	Correct	1 ms	852 KB	Output is correct
18	Correct	1 ms	852 KB	Output is correct
19	Correct	1 ms	1108 KB	Output is correct
20	Correct	1 ms	2004 KB	Output is correct
21	Correct	1 ms	1880 KB	Output is correct
22	Correct	3 ms	3540 KB	Output is correct
23	Correct	2 ms	3156 KB	Output is correct
24	Correct	3 ms	4052 KB	Output is correct
25	Correct	3 ms	3412 KB	Output is correct
26	Correct	2 ms	3412 KB	Output is correct
27	Correct	3 ms	4180 KB	Output is correct

Subtask #4
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	1236 KB	Output is correct
12	Correct	1 ms	852 KB	Output is correct
13	Correct	1 ms	852 KB	Output is correct
14	Correct	1 ms	852 KB	Output is correct
15	Correct	1 ms	980 KB	Output is correct
16	Correct	1 ms	1108 KB	Output is correct
17	Correct	1 ms	852 KB	Output is correct
18	Correct	1 ms	852 KB	Output is correct
19	Correct	1 ms	1108 KB	Output is correct
20	Correct	1 ms	2004 KB	Output is correct
21	Correct	1 ms	1880 KB	Output is correct
22	Correct	3 ms	3540 KB	Output is correct
23	Correct	2 ms	3156 KB	Output is correct
24	Correct	3 ms	4052 KB	Output is correct
25	Correct	3 ms	3412 KB	Output is correct
26	Correct	2 ms	3412 KB	Output is correct
27	Correct	3 ms	4180 KB	Output is correct
28	Correct	9 ms	11476 KB	Output is correct
29	Correct	12 ms	12372 KB	Output is correct
30	Correct	14 ms	12088 KB	Output is correct
31	Correct	9 ms	11732 KB	Output is correct
32	Correct	21 ms	13352 KB	Output is correct
33	Correct	16 ms	14036 KB	Output is correct
34	Correct	25 ms	20308 KB	Output is correct

Subtask #5
48.0 / 48.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	1236 KB	Output is correct
12	Correct	1 ms	852 KB	Output is correct
13	Correct	1 ms	852 KB	Output is correct
14	Correct	1 ms	852 KB	Output is correct
15	Correct	1 ms	980 KB	Output is correct
16	Correct	1 ms	1108 KB	Output is correct
17	Correct	1 ms	852 KB	Output is correct
18	Correct	1 ms	852 KB	Output is correct
19	Correct	1 ms	1108 KB	Output is correct
20	Correct	1 ms	2004 KB	Output is correct
21	Correct	1 ms	1880 KB	Output is correct
22	Correct	3 ms	3540 KB	Output is correct
23	Correct	2 ms	3156 KB	Output is correct
24	Correct	3 ms	4052 KB	Output is correct
25	Correct	3 ms	3412 KB	Output is correct
26	Correct	2 ms	3412 KB	Output is correct
27	Correct	3 ms	4180 KB	Output is correct
28	Correct	9 ms	11476 KB	Output is correct
29	Correct	12 ms	12372 KB	Output is correct
30	Correct	14 ms	12088 KB	Output is correct
31	Correct	9 ms	11732 KB	Output is correct
32	Correct	21 ms	13352 KB	Output is correct
33	Correct	16 ms	14036 KB	Output is correct
34	Correct	25 ms	20308 KB	Output is correct
35	Correct	52 ms	54700 KB	Output is correct
36	Correct	124 ms	64180 KB	Output is correct
37	Correct	49 ms	53408 KB	Output is correct
38	Correct	80 ms	56312 KB	Output is correct
39	Correct	102 ms	52200 KB	Output is correct
40	Correct	171 ms	78208 KB	Output is correct

답안 #786762

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 12.0 / 12.0

Subtask #3 13.0 / 13.0

Subtask #4 18.0 / 18.0

Subtask #5 48.0 / 48.0

Subtask #1
9.0 / 9.0

Subtask #2
12.0 / 12.0

Subtask #3
13.0 / 13.0

Subtask #4
18.0 / 18.0

Subtask #5
48.0 / 48.0