oj.uz

Submission #786386

# Submission time Handle Problem Language Result Execution time Memory
786386 2023-07-18T07:21:03 Z 박영우(#10030) NoM (RMI21_nom) C++17
100 / 100
 435 ms 141332 KB 
#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[MAX][MAX * 2];
ll C[MAX * 2][MAX * 2];
void add(ll& a, ll b) { a = (a + b) % MOD; }
ll mpow(ll x, ll y = MOD - 2) {
	if (!y) return 1;
	ll res = mpow(x, y >> 1);
	res *= res;
	res %= MOD;
	if (y & 1) res = (res * x) % MOD;
	return res;
}
ll P(ll n, ll r) {
	return (C[n][r] * fact[r]) % MOD;
}
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int N, M;
	cin >> N >> M;
	int i, j, k;
	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]++;
	fact[0] = 1;
	for (i = 1; i <= N * 2; i++) fact[i] = (fact[i - 1] * i) % MOD;
	dp[0][A[0]] = 1;
	for (i = 1; i < M; i++) for (j = 0; j <= N * 2; j++) for (k = 0; k <= min(j, A[i]); k++) add(dp[i][j + A[i] - k * 2], dp[i - 1][j] * ((P(A[i], k) * C[j][k]) % MOD));
	ll ans = (dp[M - 1][0] * fact[N]) % MOD;
	ans *= mpow(2, N);
	ans %= MOD;
	cout << ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 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 0 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 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 0 ms 340 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 852 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 1 ms 1236 KB Output is correct
16 Correct 1 ms 1108 KB Output is correct
17 Correct 1 ms 980 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 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 0 ms 340 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 852 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 1 ms 1236 KB Output is correct
16 Correct 1 ms 1108 KB Output is correct
17 Correct 1 ms 980 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 2 ms 2132 KB Output is correct
21 Correct 3 ms 2408 KB Output is correct
22 Correct 9 ms 5588 KB Output is correct
23 Correct 3 ms 3284 KB Output is correct
24 Correct 6 ms 5204 KB Output is correct
25 Correct 6 ms 5332 KB Output is correct
26 Correct 3 ms 3540 KB Output is correct
27 Correct 7 ms 6740 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 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 0 ms 340 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 852 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 1 ms 1236 KB Output is correct
16 Correct 1 ms 1108 KB Output is correct
17 Correct 1 ms 980 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 2 ms 2132 KB Output is correct
21 Correct 3 ms 2408 KB Output is correct
22 Correct 9 ms 5588 KB Output is correct
23 Correct 3 ms 3284 KB Output is correct
24 Correct 6 ms 5204 KB Output is correct
25 Correct 6 ms 5332 KB Output is correct
26 Correct 3 ms 3540 KB Output is correct
27 Correct 7 ms 6740 KB Output is correct
28 Correct 23 ms 11732 KB Output is correct
29 Correct 22 ms 17024 KB Output is correct
30 Correct 29 ms 20192 KB Output is correct
31 Correct 19 ms 11988 KB Output is correct
32 Correct 24 ms 18260 KB Output is correct
33 Correct 33 ms 23712 KB Output is correct
34 Correct 57 ms 36424 KB Output is correct

Subtask #5
48.0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 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 0 ms 340 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 1 ms 852 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 1 ms 1236 KB Output is correct
16 Correct 1 ms 1108 KB Output is correct
17 Correct 1 ms 980 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 2 ms 2132 KB Output is correct
21 Correct 3 ms 2408 KB Output is correct
22 Correct 9 ms 5588 KB Output is correct
23 Correct 3 ms 3284 KB Output is correct
24 Correct 6 ms 5204 KB Output is correct
25 Correct 6 ms 5332 KB Output is correct
26 Correct 3 ms 3540 KB Output is correct
27 Correct 7 ms 6740 KB Output is correct
28 Correct 23 ms 11732 KB Output is correct
29 Correct 22 ms 17024 KB Output is correct
30 Correct 29 ms 20192 KB Output is correct
31 Correct 19 ms 11988 KB Output is correct
32 Correct 24 ms 18260 KB Output is correct
33 Correct 33 ms 23712 KB Output is correct
34 Correct 57 ms 36424 KB Output is correct
35 Correct 94 ms 55116 KB Output is correct
36 Correct 290 ms 117388 KB Output is correct
37 Correct 90 ms 53864 KB Output is correct
38 Correct 188 ms 80632 KB Output is correct
39 Correct 228 ms 95152 KB Output is correct
40 Correct 435 ms 141332 KB Output is correct