結果
問題 | No.1856 Mex Sum 2 |
ユーザー | Mitarushi |
提出日時 | 2021-04-17 17:51:36 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,346 ms / 3,000 ms |
コード長 | 1,802 bytes |
コンパイル時間 | 364 ms |
コンパイル使用メモリ | 87,148 KB |
実行使用メモリ | 79,076 KB |
最終ジャッジ日時 | 2023-09-17 07:58:14 |
合計ジャッジ時間 | 42,223 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 76 ms
71,268 KB |
testcase_01 | AC | 75 ms
71,284 KB |
testcase_02 | AC | 111 ms
77,704 KB |
testcase_03 | AC | 75 ms
71,448 KB |
testcase_04 | AC | 93 ms
76,696 KB |
testcase_05 | AC | 91 ms
76,584 KB |
testcase_06 | AC | 94 ms
76,844 KB |
testcase_07 | AC | 103 ms
77,300 KB |
testcase_08 | AC | 77 ms
71,220 KB |
testcase_09 | AC | 89 ms
76,476 KB |
testcase_10 | AC | 93 ms
76,564 KB |
testcase_11 | AC | 92 ms
76,712 KB |
testcase_12 | AC | 81 ms
76,204 KB |
testcase_13 | AC | 74 ms
71,408 KB |
testcase_14 | AC | 74 ms
71,308 KB |
testcase_15 | AC | 75 ms
71,592 KB |
testcase_16 | AC | 93 ms
76,624 KB |
testcase_17 | AC | 111 ms
77,524 KB |
testcase_18 | AC | 109 ms
78,032 KB |
testcase_19 | AC | 92 ms
76,540 KB |
testcase_20 | AC | 91 ms
76,472 KB |
testcase_21 | AC | 77 ms
71,280 KB |
testcase_22 | AC | 110 ms
77,848 KB |
testcase_23 | AC | 77 ms
71,468 KB |
testcase_24 | AC | 100 ms
77,252 KB |
testcase_25 | AC | 108 ms
77,784 KB |
testcase_26 | AC | 76 ms
71,276 KB |
testcase_27 | AC | 75 ms
71,288 KB |
testcase_28 | AC | 76 ms
71,224 KB |
testcase_29 | AC | 423 ms
78,948 KB |
testcase_30 | AC | 286 ms
78,892 KB |
testcase_31 | AC | 407 ms
78,864 KB |
testcase_32 | AC | 559 ms
78,820 KB |
testcase_33 | AC | 573 ms
78,780 KB |
testcase_34 | AC | 410 ms
78,964 KB |
testcase_35 | AC | 304 ms
78,884 KB |
testcase_36 | AC | 199 ms
78,556 KB |
testcase_37 | AC | 393 ms
78,860 KB |
testcase_38 | AC | 181 ms
78,584 KB |
testcase_39 | AC | 130 ms
78,140 KB |
testcase_40 | AC | 132 ms
78,300 KB |
testcase_41 | AC | 135 ms
78,260 KB |
testcase_42 | AC | 1,302 ms
78,880 KB |
testcase_43 | AC | 1,172 ms
78,852 KB |
testcase_44 | AC | 1,234 ms
78,724 KB |
testcase_45 | AC | 1,286 ms
78,932 KB |
testcase_46 | AC | 1,178 ms
78,740 KB |
testcase_47 | AC | 1,238 ms
78,808 KB |
testcase_48 | AC | 1,312 ms
78,980 KB |
testcase_49 | AC | 1,308 ms
79,076 KB |
testcase_50 | AC | 1,082 ms
78,844 KB |
testcase_51 | AC | 1,345 ms
78,744 KB |
testcase_52 | AC | 1,335 ms
78,752 KB |
testcase_53 | AC | 1,337 ms
78,748 KB |
testcase_54 | AC | 1,341 ms
78,732 KB |
testcase_55 | AC | 1,346 ms
79,028 KB |
testcase_56 | AC | 1,343 ms
78,752 KB |
testcase_57 | AC | 1,335 ms
78,832 KB |
testcase_58 | AC | 1,340 ms
78,880 KB |
testcase_59 | AC | 1,342 ms
78,812 KB |
testcase_60 | AC | 1,343 ms
78,888 KB |
testcase_61 | AC | 1,342 ms
78,856 KB |
testcase_62 | AC | 1,341 ms
78,856 KB |
testcase_63 | AC | 1,343 ms
78,832 KB |
testcase_64 | AC | 1,336 ms
78,940 KB |
testcase_65 | AC | 1,340 ms
78,708 KB |
testcase_66 | AC | 1,342 ms
78,896 KB |
ソースコード
mod = 998244353 def fft_inplace(a, w): n = len(a) m = n t = 1 while m >= 2: mh = m >> 1 for i in range(0, n, m): for s in range(mh): j, k = i+s, i+mh+s a[j], u = a[j]+a[k], a[j]-a[k] a[k] = u * w[s*t] % mod m = mh t *= 2 def ifft_inplace(a, w): n = len(a) m = 2 t = -(n >> 1) while m <= n: mh = m >> 1 for i in range(0, n, m): for s in range(mh): j, k = i+s, i+mh+s u = a[k] * w[s*t] % mod a[j], a[k] = a[j]+u, a[j]-u m <<= 1 t //= 2 n_inv = pow(n, mod-2, mod) for i in range(n): a[i] = a[i] * n_inv % mod n, m = map(int, input().split()) fixed_n = 1 << ((n+1)*2).bit_length() w_root = pow(3, (mod-1)//fixed_n, mod) w = [1] * fixed_n for i in range(1, fixed_n): w[i] = w[i-1] * w_root % mod frac = [1] * (n + 1) for i in range(1, n+1): frac[i] = frac[i-1] * i % mod frac_inv = [0] * (n+1) frac_inv[n] = pow(frac[n], mod-2, mod) for i in range(1, n+1)[::-1]: frac_inv[i-1] = frac_inv[i] * i % mod dp1 = [0] * fixed_n dp1[0] = 1 t = [0] * fixed_n for i in range(n+1): t[i] = (pow(2, i, mod)-1) * pow(pow(2, i, mod) * frac[i], mod-2, mod) % mod fft_inplace(t, w) ans_sub = [0] * (n+1) for k in range(min(n, m+1)): fft_inplace(dp1, w) for i, j in enumerate(t): dp1[i] = dp1[i] * j % mod ifft_inplace(dp1, w) pow_tmp = 1 for i in range(k+1, n+1)[::-1]: ans_sub[i] += dp1[i] * pow_tmp % mod pow_tmp = pow_tmp * (m - k) % mod for i in range(n+1, fixed_n): dp1[i] = 0 ans = sum(ans_sub[i] % mod * frac_inv[n-i] for i in range(n+1)) % mod ans = ans * pow(2, n, mod) * frac[n] % mod print(ans)