Submission #786771

#	Time	Username	Problem	Language	Result	Execution time	Memory
786771		flappybird	NoM (RMI21_nom)	C++17	100 / 100	124 ms	30956 KiB

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;
	int mx = 10;
	for (i = 1; i <= N * 2; i++) A[i % M]++;
	for (i = 0; i < M; i++) mx = max(mx, A[i]);
	for (i = 1; i <= N * 2; i++) {
		C[i][0] = C[i][i] = 1;
		for (j = 1; j < i && j <= mx + 2; j++) {
			C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]);
			if (C[i][j] >= MOD) C[i][j] -= MOD;
		}
	}
	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 / 9
• Subtask 2: 12 / 12
• Subtask 3: 13 / 13
• Subtask 4: 18 / 18
• Subtask 5: 48 / 48