結果
問題 | No.2243 Coaching Schedule |
ユーザー | shobonvip |
提出日時 | 2023-03-10 00:38:47 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,964 ms / 4,000 ms |
コード長 | 2,169 bytes |
コンパイル時間 | 364 ms |
コンパイル使用メモリ | 81,660 KB |
実行使用メモリ | 128,964 KB |
最終ジャッジ日時 | 2023-10-18 06:32:39 |
合計ジャッジ時間 | 19,647 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 65 ms
75,104 KB |
testcase_01 | AC | 65 ms
75,104 KB |
testcase_02 | AC | 64 ms
75,104 KB |
testcase_03 | AC | 65 ms
75,104 KB |
testcase_04 | AC | 67 ms
76,036 KB |
testcase_05 | AC | 288 ms
125,592 KB |
testcase_06 | AC | 454 ms
116,880 KB |
testcase_07 | AC | 474 ms
117,904 KB |
testcase_08 | AC | 454 ms
117,904 KB |
testcase_09 | AC | 574 ms
116,880 KB |
testcase_10 | AC | 594 ms
117,680 KB |
testcase_11 | AC | 597 ms
117,692 KB |
testcase_12 | AC | 1,964 ms
116,352 KB |
testcase_13 | AC | 1,781 ms
116,880 KB |
testcase_14 | AC | 1,783 ms
116,880 KB |
testcase_15 | AC | 1,765 ms
116,880 KB |
testcase_16 | AC | 246 ms
128,964 KB |
testcase_17 | AC | 195 ms
98,892 KB |
testcase_18 | AC | 372 ms
113,336 KB |
testcase_19 | AC | 516 ms
114,240 KB |
testcase_20 | AC | 429 ms
108,432 KB |
testcase_21 | AC | 257 ms
106,320 KB |
testcase_22 | AC | 237 ms
106,056 KB |
testcase_23 | AC | 115 ms
92,800 KB |
testcase_24 | AC | 305 ms
108,960 KB |
testcase_25 | AC | 128 ms
93,468 KB |
testcase_26 | AC | 169 ms
97,972 KB |
testcase_27 | AC | 321 ms
108,960 KB |
testcase_28 | AC | 132 ms
93,480 KB |
testcase_29 | AC | 415 ms
119,256 KB |
testcase_30 | AC | 426 ms
114,504 KB |
testcase_31 | AC | 424 ms
116,548 KB |
testcase_32 | AC | 232 ms
105,264 KB |
testcase_33 | AC | 173 ms
98,788 KB |
testcase_34 | AC | 378 ms
119,520 KB |
testcase_35 | AC | 441 ms
113,232 KB |
testcase_36 | AC | 417 ms
115,032 KB |
ソースコード
# FFT が遅い mod = 998244353 g = 3 ginv = 332748118 W = [pow(g, (mod-1)>>i, mod) for i in range(24)] Winv = [pow(ginv, (mod-1)>>i, mod) for i in range(24)] def fft(k, f): for l in range(k, 0, -1): d = 1<<l-1 U = [1] for i in range(d): U.append(U[-1]*W[l]%mod) for i in range(1<<k-l): for j in range(d): s = i*2*d+j f[s], f[s+d] = (f[s]+f[s+d])%mod, U[j]*(f[s]-f[s+d])%mod def fftinv(k, f): for l in range(1, k+1): d = 1<<l-1 for i in range(1<<k-l): u = 1 for j in range(i*2*d, (i*2+1)*d): f[j+d] *= u f[j], f[j+d] = (f[j]+f[j+d])%mod, (f[j]-f[j+d])%mod u *= Winv[l] u %= mod def convolution(a, b): le = len(a)+len(b)-1 k = le.bit_length() n = 1<<k a = a+[0]*(n-len(a)) b = b+[0]*(n-len(b)) fft(k, a) fft(k, b) for i in range(n): a[i] *= b[i] a[i] %= mod fftinv(k, a) ninv = pow(n, mod-2, mod) for i in range(le): a[i] *= ninv a[i] %= mod return a[:le] mod = 998244353 N = 10**6 + 5 fact = [1]*(N+1) factinv = [1]*(N+1) for i in range(2, N+1): fact[i] = fact[i-1] * i % mod factinv[-1] = pow(fact[-1], mod-2, mod) for i in range(N-1, 1, -1): factinv[i] = factinv[i+1] * (i+1) % mod def cmb(a, b): if (a < b) or (b < 0): return 0 return fact[a] * factinv[b] % mod * factinv[a-b] % mod # ここから本編. m,n = map(int,input().split()) a = list(map(int,input().split())) # 頻度ごとに集計しています O(N+M) c = [0] * m for i in range(n): c[a[i]-1] += 1 cl = [0] * (n+1) for i in range(m): cl[c[i]] += 1 cv = [] cmax = 0 for i in range(n+1): if cl[i] > 0: cv.append((i, cl[i])) cmax = max(cmax, i) # 想定解通りにやります O(N^1.5 log N) ? わからんぬ d = [1] * (n+1) for i in range(n+1): if cmax > i: d[i] = 0 continue for j, cnt in cv: d[i] *= pow(fact[i] * factinv[i-j] % mod, cnt, mod) d[i] %= mod # またまたFFTによって練習の日を固定したときの数え上げを計算します O(N log N) f = [d[i] * factinv[i] % mod for i in range(n + 1)] g = [(-1) ** (i % 2) * factinv[i] % mod for i in range(n + 1)] fg = convolution(f, g) ans = 0 for i in range(n + 1): ans += fact[i] * fg[i] % mod print(ans % mod)