結果

問題 No.1857 Gacha Addiction
ユーザー MitarushiMitarushi
提出日時 2022-02-24 23:34:27
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 4,263 ms / 6,000 ms
コード長 2,839 bytes
コンパイル時間 171 ms
コンパイル使用メモリ 82,560 KB
実行使用メモリ 268,368 KB
最終ジャッジ日時 2024-07-02 14:19:13
合計ジャッジ時間 129,350 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 47 ms
54,144 KB
testcase_01 AC 49 ms
54,144 KB
testcase_02 AC 45 ms
54,272 KB
testcase_03 AC 45 ms
54,272 KB
testcase_04 AC 223 ms
80,360 KB
testcase_05 AC 220 ms
80,100 KB
testcase_06 AC 216 ms
80,228 KB
testcase_07 AC 218 ms
80,368 KB
testcase_08 AC 214 ms
80,224 KB
testcase_09 AC 1,338 ms
158,176 KB
testcase_10 AC 1,332 ms
157,856 KB
testcase_11 AC 1,337 ms
157,572 KB
testcase_12 AC 1,337 ms
157,876 KB
testcase_13 AC 1,361 ms
158,288 KB
testcase_14 AC 4,127 ms
263,408 KB
testcase_15 AC 4,182 ms
265,320 KB
testcase_16 AC 4,173 ms
263,912 KB
testcase_17 AC 4,176 ms
265,024 KB
testcase_18 AC 4,207 ms
262,200 KB
testcase_19 AC 4,145 ms
268,008 KB
testcase_20 AC 4,135 ms
267,884 KB
testcase_21 AC 4,148 ms
267,820 KB
testcase_22 AC 4,158 ms
268,004 KB
testcase_23 AC 4,127 ms
267,744 KB
testcase_24 AC 4,120 ms
267,880 KB
testcase_25 AC 4,146 ms
268,000 KB
testcase_26 AC 4,263 ms
268,008 KB
testcase_27 AC 4,147 ms
268,128 KB
testcase_28 AC 4,154 ms
267,736 KB
testcase_29 AC 4,225 ms
267,872 KB
testcase_30 AC 4,143 ms
267,880 KB
testcase_31 AC 4,143 ms
267,868 KB
testcase_32 AC 4,151 ms
267,872 KB
testcase_33 AC 4,168 ms
267,872 KB
testcase_34 AC 4,170 ms
267,792 KB
testcase_35 AC 4,159 ms
268,120 KB
testcase_36 AC 4,173 ms
268,256 KB
testcase_37 AC 4,134 ms
267,864 KB
testcase_38 AC 4,156 ms
267,676 KB
testcase_39 AC 1,533 ms
168,312 KB
testcase_40 AC 1,664 ms
180,972 KB
testcase_41 AC 2,032 ms
208,252 KB
testcase_42 AC 545 ms
102,064 KB
testcase_43 AC 3,819 ms
268,368 KB
testcase_44 AC 4,166 ms
263,324 KB
testcase_45 AC 46 ms
54,144 KB
testcase_46 AC 46 ms
54,400 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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
0