oj.uz

답안 #786744

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
786744 2023-07-18T12:20:20 Z flappybird NoM (RMI21_nom) C++17
100 / 100
 216 ms 117232 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];
inline void add(ll& a, ll b) { a = (a + b) % MOD; }
inline 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;
	int sum = A[0];
	for (i = 1; i < M; i++) {
		for (j = 0; j <= sum; 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));
		sum += A[i];
	}
	ll ans = (dp[M - 1][0] * fact[N]) % MOD;
	ans *= mpow(2, N);
	ans %= MOD;
	cout << ans;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 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 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 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 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 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 1 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 980 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

# 결과 실행 시간 메모리 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 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 1 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 980 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 2 ms 2260 KB Output is correct
22 Correct 4 ms 5076 KB Output is correct
23 Correct 2 ms 3156 KB Output is correct
24 Correct 4 ms 4948 KB Output is correct
25 Correct 4 ms 4836 KB Output is correct
26 Correct 3 ms 3544 KB Output is correct
27 Correct 5 ms 5972 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 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 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 1 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 980 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 2 ms 2260 KB Output is correct
22 Correct 4 ms 5076 KB Output is correct
23 Correct 2 ms 3156 KB Output is correct
24 Correct 4 ms 4948 KB Output is correct
25 Correct 4 ms 4836 KB Output is correct
26 Correct 3 ms 3544 KB Output is correct
27 Correct 5 ms 5972 KB Output is correct
28 Correct 11 ms 11592 KB Output is correct
29 Correct 14 ms 15312 KB Output is correct
30 Correct 17 ms 17552 KB Output is correct
31 Correct 13 ms 11860 KB Output is correct
32 Correct 16 ms 16324 KB Output is correct
33 Correct 20 ms 20400 KB Output is correct
34 Correct 34 ms 30140 KB Output is correct

Subtask #5
48.0 / 48.0

# 결과 실행 시간 메모리 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 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 1 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 980 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 2 ms 2260 KB Output is correct
22 Correct 4 ms 5076 KB Output is correct
23 Correct 2 ms 3156 KB Output is correct
24 Correct 4 ms 4948 KB Output is correct
25 Correct 4 ms 4836 KB Output is correct
26 Correct 3 ms 3544 KB Output is correct
27 Correct 5 ms 5972 KB Output is correct
28 Correct 11 ms 11592 KB Output is correct
29 Correct 14 ms 15312 KB Output is correct
30 Correct 17 ms 17552 KB Output is correct
31 Correct 13 ms 11860 KB Output is correct
32 Correct 16 ms 16324 KB Output is correct
33 Correct 20 ms 20400 KB Output is correct
34 Correct 34 ms 30140 KB Output is correct
35 Correct 60 ms 55036 KB Output is correct
36 Correct 155 ms 95400 KB Output is correct
37 Correct 57 ms 53652 KB Output is correct
38 Correct 95 ms 70128 KB Output is correct
39 Correct 120 ms 77408 KB Output is correct
40 Correct 216 ms 117232 KB Output is correct