結果
問題 | No.1856 Mex Sum 2 |
ユーザー | Mitarushi |
提出日時 | 2021-04-17 17:53:10 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,333 ms / 3,000 ms |
コード長 | 1,928 bytes |
コンパイル時間 | 400 ms |
コンパイル使用メモリ | 87,108 KB |
実行使用メモリ | 79,036 KB |
最終ジャッジ日時 | 2023-09-17 07:59:03 |
合計ジャッジ時間 | 41,567 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 74 ms
71,292 KB |
testcase_01 | AC | 74 ms
71,080 KB |
testcase_02 | AC | 106 ms
77,268 KB |
testcase_03 | AC | 74 ms
71,380 KB |
testcase_04 | AC | 93 ms
76,520 KB |
testcase_05 | AC | 94 ms
76,596 KB |
testcase_06 | AC | 91 ms
76,596 KB |
testcase_07 | AC | 101 ms
77,428 KB |
testcase_08 | AC | 75 ms
71,132 KB |
testcase_09 | AC | 88 ms
76,336 KB |
testcase_10 | AC | 93 ms
76,564 KB |
testcase_11 | AC | 90 ms
76,576 KB |
testcase_12 | AC | 80 ms
76,040 KB |
testcase_13 | AC | 75 ms
71,476 KB |
testcase_14 | AC | 76 ms
71,464 KB |
testcase_15 | AC | 75 ms
71,136 KB |
testcase_16 | AC | 92 ms
76,664 KB |
testcase_17 | AC | 104 ms
77,516 KB |
testcase_18 | AC | 104 ms
77,744 KB |
testcase_19 | AC | 92 ms
76,596 KB |
testcase_20 | AC | 92 ms
76,672 KB |
testcase_21 | AC | 75 ms
71,492 KB |
testcase_22 | AC | 105 ms
77,560 KB |
testcase_23 | AC | 75 ms
71,248 KB |
testcase_24 | AC | 100 ms
77,404 KB |
testcase_25 | AC | 104 ms
77,424 KB |
testcase_26 | AC | 74 ms
71,356 KB |
testcase_27 | AC | 74 ms
71,248 KB |
testcase_28 | AC | 76 ms
71,288 KB |
testcase_29 | AC | 411 ms
78,704 KB |
testcase_30 | AC | 281 ms
78,720 KB |
testcase_31 | AC | 400 ms
78,804 KB |
testcase_32 | AC | 554 ms
78,684 KB |
testcase_33 | AC | 571 ms
78,684 KB |
testcase_34 | AC | 403 ms
78,792 KB |
testcase_35 | AC | 298 ms
78,492 KB |
testcase_36 | AC | 197 ms
78,292 KB |
testcase_37 | AC | 391 ms
78,688 KB |
testcase_38 | AC | 180 ms
78,304 KB |
testcase_39 | AC | 129 ms
78,264 KB |
testcase_40 | AC | 132 ms
78,324 KB |
testcase_41 | AC | 137 ms
78,256 KB |
testcase_42 | AC | 1,298 ms
78,720 KB |
testcase_43 | AC | 1,168 ms
78,892 KB |
testcase_44 | AC | 1,215 ms
79,016 KB |
testcase_45 | AC | 1,278 ms
78,860 KB |
testcase_46 | AC | 1,165 ms
78,808 KB |
testcase_47 | AC | 1,227 ms
78,516 KB |
testcase_48 | AC | 1,305 ms
78,724 KB |
testcase_49 | AC | 1,290 ms
78,768 KB |
testcase_50 | AC | 1,068 ms
78,564 KB |
testcase_51 | AC | 1,330 ms
78,928 KB |
testcase_52 | AC | 1,320 ms
78,840 KB |
testcase_53 | AC | 1,325 ms
78,864 KB |
testcase_54 | AC | 1,324 ms
78,720 KB |
testcase_55 | AC | 1,324 ms
78,768 KB |
testcase_56 | AC | 1,326 ms
78,728 KB |
testcase_57 | AC | 1,329 ms
79,036 KB |
testcase_58 | AC | 1,329 ms
78,808 KB |
testcase_59 | AC | 1,327 ms
78,712 KB |
testcase_60 | AC | 1,326 ms
78,864 KB |
testcase_61 | AC | 1,328 ms
78,852 KB |
testcase_62 | AC | 1,326 ms
78,872 KB |
testcase_63 | AC | 1,328 ms
78,828 KB |
testcase_64 | AC | 1,333 ms
78,732 KB |
testcase_65 | AC | 1,330 ms
78,528 KB |
testcase_66 | AC | 1,331 ms
78,752 KB |
ソースコード
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] % 998244353 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] % 998244353 a[j], a[k] = a[j]+u, a[j]-u m <<= 1 t //= 2 n_inv = pow(n, 998244353-2, 998244353) for i in range(n): a[i] = a[i] * n_inv % 998244353 n, m = map(int, input().split()) fixed_n = 1 << ((n+1)*2).bit_length() w_root = pow(3, (998244353-1)//fixed_n, 998244353) w = [1] * fixed_n for i in range(1, fixed_n): w[i] = w[i-1] * w_root % 998244353 frac = [1] * (n + 1) for i in range(1, n+1): frac[i] = frac[i-1] * i % 998244353 frac_inv = [0] * (n+1) frac_inv[n] = pow(frac[n], 998244353-2, 998244353) for i in range(1, n+1)[::-1]: frac_inv[i-1] = frac_inv[i] * i % 998244353 dp1 = [0] * fixed_n dp1[0] = 1 t = [0] * fixed_n for i in range(n+1): t[i] = (pow(2, i, 998244353)-1) * pow(pow(2, i, 998244353) * frac[i], 998244353-2, 998244353) % 998244353 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 % 998244353 ifft_inplace(dp1, w) pow_tmp = 1 for i in range(k+1, n+1)[::-1]: ans_sub[i] += dp1[i] * pow_tmp % 998244353 pow_tmp = pow_tmp * (m - k) % 998244353 for i in range(n+1, fixed_n): dp1[i] = 0 ans = sum(ans_sub[i] % 998244353 * frac_inv[n-i] for i in range(n+1)) % 998244353 ans = ans * pow(2, n, 998244353) * frac[n] % 998244353 print(ans)