結果

問題 No.2243 Coaching Schedule
ユーザー rabimea
提出日時 2023-03-10 22:20:20
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 2,325 bytes
コンパイル時間 2,205 ms
コンパイル使用メモリ 207,756 KB
最終ジャッジ日時 2025-02-11 08:34:03
ジャッジサーバーID
(参考情報)
judge4 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 27 WA * 10
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector <ll>;
const ll P = 998244353, G = 3;
ll qpow(ll a, ll b) {
ll r = 1, t = a;
for(; b; b /= 2) {
if(b & 1)
r = r * t % P;
t = t * t % P;
}
return r;
}
ll INV(ll x) { return qpow(x, P - 2); }
void ntt(vl &a, int op = 1) { // P: , G:
int n = a.size();
for (int i = 1, j = 0; i < n - 1; ++i) {
for (int s = n; j ^= s >>= 1, ~j & s;) {}
if (i < j) swap(a[i], a[j]);
}
for (int i = 1; i < n; i *= 2) {
ll u = qpow(G, (P - 1) / (i * 2));
if (op == -1) u = INV(u);
for (int j = 0; j < n; j += i * 2) {
ll w = 1;
for (int k = 0; k < i; ++k, w = w * u % P) {
int x = a[j + k], y = w * a[j + k + i] % P;
#define modto(x) ({if ((x) >= P) (x) -= P;})
a[j + k] = x + y; modto(a[j + k]);
a[j + k + i] = x - y + P; modto(a[j + k + i]);
#undef modto
}}}
if (op == -1) { ll inv = INV(n);
for (int i = 0; i < n; ++i) a[i] = a[i] * inv % P; }
}
vl multi(vl a, vl b) {
int m = a.size() + b.size() - 1;
int n = 1; while (n < m) n *= 2;
vl fa(n), fb(n), fc(n);
copy(a.begin(), a.end(), fa.begin()); ntt(fa);
copy(b.begin(), b.end(), fb.begin()); ntt(fb);
for (int i = 0; i < n; ++i) fc[i] = fa[i] * fb[i] % P;
ntt(fc, -1); fc.resize(m);
return fc;
}
const int N = 1e5 + 11;
int b[N];
ll fac[N], inv[N], ifac[N];
ll binom(int n, int m) {
if(n < m) return 0;
return fac[n] * ifac[m] % P * ifac[n - m] % P;
}
ll f[N], g[N];
int main() {
ios::sync_with_stdio(0);
inv[1] = 1;
for(int i = 2; i < N; i ++)
inv[i] = (P - P / i) * inv[P % i] % P;
fac[0] = ifac[0] = 1;
for(int i = 1; i < N; i ++) {
fac[i] = i * fac[i - 1] % P;
ifac[i] = inv[i] * ifac[i - 1] % P;
}
int m, n; cin >> m >> n;
for(int i = 1; i <= n; i ++) {
int a; cin >> a;
b[a] ++;
}
map <int, int> mp;
for(int i = 1; i <= n; i ++)
if(b[i]) mp[b[i]] ++;
for(int k = 1; k <= n; k ++) {
f[k] = 1;
for(auto [b, c] : mp) {
f[k] *= qpow(binom(k, b) * fac[b] % P, c);
f[k] %= P;
}
f[k] = f[k] * ifac[k] % P;
}
for(int i = 0; i <= n; i ++) {
int sgn = (i & 1) ? P - 1 : 1;
g[i] = sgn * ifac[i] % P;
}
vl F(f, f + n + 1);
vl G(g, g + n + 1);
vl H = multi(F, G);
ll ans = 0;
for(int i = 0; i <= n; i ++) {
ans += H[i] * fac[i];
ans %= P;
}
cout << ans << '\n';
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0