結果
問題 | No.1857 Gacha Addiction |
ユーザー | Mitarushi |
提出日時 | 2022-02-24 23:34:27 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 4,263 ms / 6,000 ms |
コード長 | 2,839 bytes |
コンパイル時間 | 762 ms |
コンパイル使用メモリ | 87,104 KB |
実行使用メモリ | 268,212 KB |
最終ジャッジ日時 | 2023-09-15 10:32:23 |
合計ジャッジ時間 | 131,750 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 92 ms
71,784 KB |
testcase_01 | AC | 94 ms
71,936 KB |
testcase_02 | AC | 94 ms
71,640 KB |
testcase_03 | AC | 96 ms
71,728 KB |
testcase_04 | AC | 253 ms
81,736 KB |
testcase_05 | AC | 252 ms
81,448 KB |
testcase_06 | AC | 254 ms
81,356 KB |
testcase_07 | AC | 256 ms
81,904 KB |
testcase_08 | AC | 254 ms
81,808 KB |
testcase_09 | AC | 1,381 ms
160,564 KB |
testcase_10 | AC | 1,383 ms
160,340 KB |
testcase_11 | AC | 1,410 ms
160,308 KB |
testcase_12 | AC | 1,409 ms
161,200 KB |
testcase_13 | AC | 1,383 ms
160,628 KB |
testcase_14 | AC | 4,206 ms
267,284 KB |
testcase_15 | AC | 4,209 ms
265,296 KB |
testcase_16 | AC | 4,185 ms
267,716 KB |
testcase_17 | AC | 4,196 ms
267,252 KB |
testcase_18 | AC | 4,178 ms
264,696 KB |
testcase_19 | AC | 4,224 ms
267,992 KB |
testcase_20 | AC | 4,212 ms
268,212 KB |
testcase_21 | AC | 4,197 ms
267,728 KB |
testcase_22 | AC | 4,183 ms
268,028 KB |
testcase_23 | AC | 4,182 ms
268,064 KB |
testcase_24 | AC | 4,263 ms
267,896 KB |
testcase_25 | AC | 4,227 ms
268,164 KB |
testcase_26 | AC | 4,174 ms
267,792 KB |
testcase_27 | AC | 4,214 ms
267,556 KB |
testcase_28 | AC | 4,223 ms
267,828 KB |
testcase_29 | AC | 4,198 ms
267,628 KB |
testcase_30 | AC | 4,195 ms
267,596 KB |
testcase_31 | AC | 4,173 ms
267,848 KB |
testcase_32 | AC | 4,229 ms
267,824 KB |
testcase_33 | AC | 4,251 ms
267,856 KB |
testcase_34 | AC | 4,181 ms
268,112 KB |
testcase_35 | AC | 4,206 ms
267,584 KB |
testcase_36 | AC | 4,189 ms
268,160 KB |
testcase_37 | AC | 4,188 ms
267,772 KB |
testcase_38 | AC | 4,215 ms
268,000 KB |
testcase_39 | AC | 1,571 ms
169,436 KB |
testcase_40 | AC | 1,710 ms
186,072 KB |
testcase_41 | AC | 2,058 ms
210,228 KB |
testcase_42 | AC | 599 ms
104,480 KB |
testcase_43 | AC | 3,826 ms
265,732 KB |
testcase_44 | AC | 4,215 ms
266,876 KB |
testcase_45 | AC | 93 ms
71,460 KB |
testcase_46 | AC | 93 ms
71,692 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 << 6: 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()) assert 1 <= n <= 15 * 10 ** 4 assert n <= s < 998244353 s_inv = pow(s, mod-2, mod) pp = list(map(int, input().split())) assert all(1 <= i for i in pp) assert sum(pp) == s p = [i * s_inv % mod for i in pp] 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) try: x = input() assert x == "" except EOFError: pass