結果
問題 | No.1856 Mex Sum 2 |
ユーザー | Mitarushi |
提出日時 | 2021-04-17 17:41:17 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,487 ms / 3,000 ms |
コード長 | 1,801 bytes |
コンパイル時間 | 409 ms |
コンパイル使用メモリ | 87,160 KB |
実行使用メモリ | 79,100 KB |
最終ジャッジ日時 | 2023-09-17 07:54:12 |
合計ジャッジ時間 | 46,480 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 74 ms
71,532 KB |
testcase_01 | AC | 76 ms
71,228 KB |
testcase_02 | AC | 116 ms
77,356 KB |
testcase_03 | AC | 72 ms
71,488 KB |
testcase_04 | AC | 93 ms
76,804 KB |
testcase_05 | AC | 91 ms
76,536 KB |
testcase_06 | AC | 91 ms
76,676 KB |
testcase_07 | AC | 102 ms
77,336 KB |
testcase_08 | AC | 76 ms
71,328 KB |
testcase_09 | AC | 88 ms
76,440 KB |
testcase_10 | AC | 91 ms
76,600 KB |
testcase_11 | AC | 93 ms
76,596 KB |
testcase_12 | AC | 81 ms
75,948 KB |
testcase_13 | AC | 75 ms
71,044 KB |
testcase_14 | AC | 74 ms
71,044 KB |
testcase_15 | AC | 74 ms
71,384 KB |
testcase_16 | AC | 89 ms
76,736 KB |
testcase_17 | AC | 107 ms
77,236 KB |
testcase_18 | AC | 107 ms
77,688 KB |
testcase_19 | AC | 93 ms
76,600 KB |
testcase_20 | AC | 91 ms
76,608 KB |
testcase_21 | AC | 73 ms
71,500 KB |
testcase_22 | AC | 106 ms
77,480 KB |
testcase_23 | AC | 76 ms
71,500 KB |
testcase_24 | AC | 99 ms
77,364 KB |
testcase_25 | AC | 107 ms
77,200 KB |
testcase_26 | AC | 73 ms
71,356 KB |
testcase_27 | AC | 74 ms
71,248 KB |
testcase_28 | AC | 78 ms
71,280 KB |
testcase_29 | AC | 450 ms
79,044 KB |
testcase_30 | AC | 299 ms
78,732 KB |
testcase_31 | AC | 428 ms
78,732 KB |
testcase_32 | AC | 601 ms
79,044 KB |
testcase_33 | AC | 624 ms
78,964 KB |
testcase_34 | AC | 432 ms
78,872 KB |
testcase_35 | AC | 316 ms
78,924 KB |
testcase_36 | AC | 206 ms
78,624 KB |
testcase_37 | AC | 420 ms
78,884 KB |
testcase_38 | AC | 187 ms
78,644 KB |
testcase_39 | AC | 129 ms
78,460 KB |
testcase_40 | AC | 133 ms
78,512 KB |
testcase_41 | AC | 134 ms
78,544 KB |
testcase_42 | AC | 1,442 ms
78,932 KB |
testcase_43 | AC | 1,298 ms
78,848 KB |
testcase_44 | AC | 1,362 ms
78,588 KB |
testcase_45 | AC | 1,428 ms
78,944 KB |
testcase_46 | AC | 1,301 ms
78,988 KB |
testcase_47 | AC | 1,372 ms
78,896 KB |
testcase_48 | AC | 1,448 ms
78,924 KB |
testcase_49 | AC | 1,443 ms
78,844 KB |
testcase_50 | AC | 1,194 ms
78,576 KB |
testcase_51 | AC | 1,479 ms
78,928 KB |
testcase_52 | AC | 1,473 ms
78,828 KB |
testcase_53 | AC | 1,480 ms
78,852 KB |
testcase_54 | AC | 1,486 ms
79,084 KB |
testcase_55 | AC | 1,486 ms
78,592 KB |
testcase_56 | AC | 1,485 ms
78,972 KB |
testcase_57 | AC | 1,481 ms
78,768 KB |
testcase_58 | AC | 1,485 ms
78,904 KB |
testcase_59 | AC | 1,479 ms
78,840 KB |
testcase_60 | AC | 1,487 ms
78,876 KB |
testcase_61 | AC | 1,485 ms
78,916 KB |
testcase_62 | AC | 1,484 ms
79,100 KB |
testcase_63 | AC | 1,487 ms
78,552 KB |
testcase_64 | AC | 1,482 ms
78,548 KB |
testcase_65 | AC | 1,480 ms
78,548 KB |
testcase_66 | AC | 1,482 ms
78,908 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], a[k] = (a[j]+a[k]) % mod, (a[j]-a[k])*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 a[k] *= w[s*t] a[j], a[k] = (a[j]+a[k]) % mod, (a[j]-a[k]) % mod 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)