結果
問題 | No.1857 Gacha Addiction |
ユーザー | Mitarushi |
提出日時 | 2021-12-31 22:11:53 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 4,988 ms / 6,000 ms |
コード長 | 2,653 bytes |
コンパイル時間 | 368 ms |
コンパイル使用メモリ | 86,816 KB |
実行使用メモリ | 261,024 KB |
最終ジャッジ日時 | 2023-09-14 14:28:56 |
合計ジャッジ時間 | 152,216 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 90 ms
71,656 KB |
testcase_01 | AC | 90 ms
71,524 KB |
testcase_02 | AC | 91 ms
71,328 KB |
testcase_03 | AC | 91 ms
71,716 KB |
testcase_04 | AC | 229 ms
80,116 KB |
testcase_05 | AC | 227 ms
79,868 KB |
testcase_06 | AC | 224 ms
79,956 KB |
testcase_07 | AC | 227 ms
80,256 KB |
testcase_08 | AC | 227 ms
80,192 KB |
testcase_09 | AC | 1,539 ms
169,768 KB |
testcase_10 | AC | 1,519 ms
167,852 KB |
testcase_11 | AC | 1,530 ms
169,516 KB |
testcase_12 | AC | 1,524 ms
168,756 KB |
testcase_13 | AC | 1,522 ms
168,496 KB |
testcase_14 | AC | 4,946 ms
260,348 KB |
testcase_15 | AC | 4,941 ms
260,384 KB |
testcase_16 | AC | 4,845 ms
260,316 KB |
testcase_17 | AC | 4,857 ms
260,836 KB |
testcase_18 | AC | 4,899 ms
260,380 KB |
testcase_19 | AC | 4,970 ms
260,712 KB |
testcase_20 | AC | 4,910 ms
260,984 KB |
testcase_21 | AC | 4,926 ms
260,576 KB |
testcase_22 | AC | 4,943 ms
260,840 KB |
testcase_23 | AC | 4,946 ms
261,024 KB |
testcase_24 | AC | 4,883 ms
260,508 KB |
testcase_25 | AC | 4,938 ms
260,820 KB |
testcase_26 | AC | 4,873 ms
260,608 KB |
testcase_27 | AC | 4,928 ms
260,704 KB |
testcase_28 | AC | 4,946 ms
260,704 KB |
testcase_29 | AC | 4,905 ms
260,972 KB |
testcase_30 | AC | 4,888 ms
260,980 KB |
testcase_31 | AC | 4,886 ms
260,536 KB |
testcase_32 | AC | 4,928 ms
260,660 KB |
testcase_33 | AC | 4,988 ms
260,712 KB |
testcase_34 | AC | 4,922 ms
260,540 KB |
testcase_35 | AC | 4,947 ms
260,540 KB |
testcase_36 | AC | 4,972 ms
260,468 KB |
testcase_37 | AC | 4,988 ms
260,320 KB |
testcase_38 | AC | 4,937 ms
260,432 KB |
testcase_39 | AC | 1,744 ms
178,508 KB |
testcase_40 | AC | 1,799 ms
181,748 KB |
testcase_41 | AC | 2,337 ms
220,932 KB |
testcase_42 | AC | 598 ms
104,900 KB |
testcase_43 | AC | 4,497 ms
260,044 KB |
testcase_44 | AC | 4,965 ms
260,900 KB |
testcase_45 | AC | 91 ms
71,520 KB |
testcase_46 | AC | 91 ms
71,620 KB |
ソースコード
import collections 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 def normal_convolution(a, b): n = max(len(a) + len(b) - 1, 1) c = [0] * n for i in range(len(a)): for j in range(len(b)): c[i+j] += a[i] * b[j] for i in range(n): c[i] %= mod return c def convolution(a, b): n2 = max(len(a) + len(b), 1) if len(a) * len(b) < 1 << 10: return normal_convolution(a, b) n = 1 << (n2-1).bit_length() a = a + [0] * (n-len(a)) b = b + [0] * (n-len(b)) w_root = pow(3, (mod-1)//n, mod) w = [1] * n for i in range(1, n): w[i] = w[i-1] * w_root % mod fft_inplace(a, w) fft_inplace(b, w) c = [i*j % mod for i, j in zip(a, b)] ifft_inplace(c, w) return c[:n2] class Poly: def __init__(Self, coeffs): Self.coeffs = coeffs def __add__(Self, other): n = max(len(Self.coeffs), len(other.coeffs)) result = [0] * n for idx, i in enumerate(Self.coeffs): result[idx] += i for idx, i in enumerate(other.coeffs): result[idx] += i result[idx] %= mod return Poly(result) def __mul__(Self, other): return Poly(convolution(Self.coeffs, other.coeffs)) class Fraction: def __init__(Self, num, den): Self.num = num Self.den = den def __add__(Self, other): return Fraction(Self.num * other.den + Self.den * other.num, Self.den * other.den) n, s = map(int, input().split()) s_inv = pow(s, mod-2, mod) p = [i * s_inv % mod for i in map(int, input().split())] fractions = collections.deque( Fraction(Poly([0, i ** 2 % mod]), Poly([1, i])) for i in p ) while len(fractions) > 1: fractions.append(fractions.popleft() + fractions.popleft()) ans = 0 factorial = 2 for i in range(1, n + 1): ans += fractions[0].num.coeffs[i] * factorial % mod factorial = factorial * (i + 2) % mod ans %= mod print(ans)