結果
問題 | No.2839 AND Constraint |
ユーザー | とりゐ |
提出日時 | 2024-07-31 02:47:37 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 192 ms / 2,000 ms |
コード長 | 5,337 bytes |
コンパイル時間 | 586 ms |
コンパイル使用メモリ | 82,376 KB |
実行使用メモリ | 78,072 KB |
最終ジャッジ日時 | 2024-07-31 02:47:41 |
合計ジャッジ時間 | 3,752 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 34 ms
54,012 KB |
testcase_01 | AC | 36 ms
54,612 KB |
testcase_02 | AC | 53 ms
66,052 KB |
testcase_03 | AC | 152 ms
77,708 KB |
testcase_04 | AC | 34 ms
53,352 KB |
testcase_05 | AC | 41 ms
62,048 KB |
testcase_06 | AC | 191 ms
77,708 KB |
testcase_07 | AC | 192 ms
77,708 KB |
testcase_08 | AC | 39 ms
59,900 KB |
testcase_09 | AC | 93 ms
76,688 KB |
testcase_10 | AC | 106 ms
77,720 KB |
testcase_11 | AC | 118 ms
78,072 KB |
testcase_12 | AC | 135 ms
77,332 KB |
testcase_13 | AC | 58 ms
70,568 KB |
testcase_14 | AC | 153 ms
77,724 KB |
testcase_15 | AC | 113 ms
77,704 KB |
testcase_16 | AC | 155 ms
77,824 KB |
testcase_17 | AC | 136 ms
77,156 KB |
testcase_18 | AC | 54 ms
68,004 KB |
testcase_19 | AC | 96 ms
76,744 KB |
ソースコード
""" f_0 = 1 f_{i+1} = f_i + x * f_i ^ 2 """ MOD = 998244353 IMAG = 911660635 IIMAG = 86583718 rate2 = ( 0, 911660635, 509520358, 369330050, 332049552, 983190778, 123842337, 238493703, 975955924, 603855026, 856644456, 131300601, 842657263, 730768835, 942482514, 806263778, 151565301, 510815449, 503497456, 743006876, 741047443, 56250497, 867605899, 0, ) irate2 = ( 0, 86583718, 372528824, 373294451, 645684063, 112220581, 692852209, 155456985, 797128860, 90816748, 860285882, 927414960, 354738543, 109331171, 293255632, 535113200, 308540755, 121186627, 608385704, 438932459, 359477183, 824071951, 103369235, 0, ) rate3 = ( 0, 372528824, 337190230, 454590761, 816400692, 578227951, 180142363, 83780245, 6597683, 70046822, 623238099, 183021267, 402682409, 631680428, 344509872, 689220186, 365017329, 774342554, 729444058, 102986190, 128751033, 395565204, 0, ) irate3 = ( 0, 509520358, 929031873, 170256584, 839780419, 282974284, 395914482, 444904435, 72135471, 638914820, 66769500, 771127074, 985925487, 262319669, 262341272, 625870173, 768022760, 859816005, 914661783, 430819711, 272774365, 530924681, 0, ) def butterfly(a): n = len(a) h = (n - 1).bit_length() le = 0 while le < h: if h - le == 1: p = 1 << (h - le - 1) rot = 1 for s in range(1 << le): offset = s << (h - le) for i in range(p): l = a[i + offset] r = a[i + offset + p] * rot a[i + offset] = (l + r) % MOD a[i + offset + p] = (l - r) % MOD rot *= rate2[(~s & -~s).bit_length()] rot %= MOD le += 1 else: p = 1 << (h - le - 2) rot = 1 for s in range(1 << le): rot2 = rot * rot % MOD rot3 = rot2 * rot % MOD offset = s << (h - le) for i in range(p): a0 = a[i + offset] a1 = a[i + offset + p] * rot a2 = a[i + offset + p * 2] * rot2 a3 = a[i + offset + p * 3] * rot3 a1na3imag = (a1 - a3) % MOD * IMAG a[i + offset] = (a0 + a2 + a1 + a3) % MOD a[i + offset + p] = (a0 + a2 - a1 - a3) % MOD a[i + offset + p * 2] = (a0 - a2 + a1na3imag) % MOD a[i + offset + p * 3] = (a0 - a2 - a1na3imag) % MOD rot *= rate3[(~s & -~s).bit_length()] rot %= MOD le += 2 def butterfly_inv(a): n = len(a) h = (n - 1).bit_length() le = h while le: if le == 1: p = 1 << (h - le) irot = 1 for s in range(1 << (le - 1)): offset = s << (h - le + 1) for i in range(p): l = a[i + offset] r = a[i + offset + p] a[i + offset] = (l + r) % MOD a[i + offset + p] = (l - r) * irot % MOD irot *= irate2[(~s & -~s).bit_length()] irot %= MOD le -= 1 else: p = 1 << (h - le) irot = 1 for s in range(1 << (le - 2)): irot2 = irot * irot % MOD irot3 = irot2 * irot % MOD offset = s << (h - le + 2) for i in range(p): a0 = a[i + offset] a1 = a[i + offset + p] a2 = a[i + offset + p * 2] a3 = a[i + offset + p * 3] a2na3iimag = (a2 - a3) * IIMAG % MOD a[i + offset] = (a0 + a1 + a2 + a3) % MOD a[i + offset + p] = (a0 - a1 + a2na3iimag) * irot % MOD a[i + offset + p * 2] = (a0 + a1 - a2 - a3) * irot2 % MOD a[i + offset + p * 3] = (a0 - a1 - a2na3iimag) * irot3 % MOD irot *= irate3[(~s & -~s).bit_length()] irot %= MOD le -= 2 def multiply(s, t): n = len(s) m = len(t) if min(n, m) <= 60: a = [0] * (n + m - 1) for i in range(n): if i % 8 == 0: for j in range(m): a[i + j] += s[i] * t[j] a[i + j] %= MOD else: for j in range(m): a[i + j] += s[i] * t[j] return [x % MOD for x in a] a = s.copy() b = t.copy() z = 1 << (n + m - 2).bit_length() a += [0] * (z - n) b += [0] * (z - m) butterfly(a) butterfly(b) for i in range(z): a[i] *= b[i] a[i] %= MOD butterfly_inv(a) a = a[: n + m - 1] iz = pow(z, MOD - 2, MOD) return [v * iz % MOD for v in a] n, m = map(int, input().split()) f = [1] + [0] * m for _ in range(n): g = multiply(f, f) for i in range(m): f[i + 1] += g[i] f[i + 1] %= MOD print(f[m])