結果

問題 No.1857 Gacha Addiction
ユーザー MitarushiMitarushi
提出日時 2021-12-31 22:51:07
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 4,414 ms / 6,000 ms
コード長 2,354 bytes
コンパイル時間 380 ms
コンパイル使用メモリ 86,600 KB
実行使用メモリ 296,280 KB
最終ジャッジ日時 2023-09-14 14:40:25
合計ジャッジ時間 133,206 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 97 ms
71,164 KB
testcase_01 AC 93 ms
71,552 KB
testcase_02 AC 97 ms
71,512 KB
testcase_03 AC 95 ms
71,184 KB
testcase_04 AC 236 ms
81,128 KB
testcase_05 AC 234 ms
81,156 KB
testcase_06 AC 239 ms
81,312 KB
testcase_07 AC 237 ms
81,444 KB
testcase_08 AC 235 ms
81,148 KB
testcase_09 AC 1,431 ms
213,304 KB
testcase_10 AC 1,424 ms
213,376 KB
testcase_11 AC 1,420 ms
213,392 KB
testcase_12 AC 1,411 ms
213,104 KB
testcase_13 AC 1,417 ms
212,816 KB
testcase_14 AC 4,304 ms
279,152 KB
testcase_15 AC 4,288 ms
275,724 KB
testcase_16 AC 4,305 ms
284,792 KB
testcase_17 AC 4,414 ms
277,608 KB
testcase_18 AC 4,312 ms
278,264 KB
testcase_19 AC 4,302 ms
283,404 KB
testcase_20 AC 4,305 ms
283,368 KB
testcase_21 AC 4,315 ms
284,388 KB
testcase_22 AC 4,293 ms
284,740 KB
testcase_23 AC 4,293 ms
284,564 KB
testcase_24 AC 4,306 ms
284,544 KB
testcase_25 AC 4,324 ms
284,600 KB
testcase_26 AC 4,255 ms
284,816 KB
testcase_27 AC 4,246 ms
285,228 KB
testcase_28 AC 4,228 ms
284,540 KB
testcase_29 AC 4,198 ms
284,688 KB
testcase_30 AC 4,231 ms
284,512 KB
testcase_31 AC 4,218 ms
284,712 KB
testcase_32 AC 4,237 ms
285,168 KB
testcase_33 AC 4,264 ms
284,580 KB
testcase_34 AC 4,228 ms
285,352 KB
testcase_35 AC 4,237 ms
284,436 KB
testcase_36 AC 4,244 ms
285,052 KB
testcase_37 AC 4,246 ms
285,128 KB
testcase_38 AC 4,240 ms
284,496 KB
testcase_39 AC 1,530 ms
227,452 KB
testcase_40 AC 1,593 ms
230,348 KB
testcase_41 AC 2,076 ms
264,492 KB
testcase_42 AC 578 ms
125,188 KB
testcase_43 AC 3,912 ms
296,280 KB
testcase_44 AC 4,211 ms
276,240 KB
testcase_45 AC 90 ms
71,576 KB
testcase_46 AC 89 ms
71,232 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 <<= 1


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 zero_pad(a, n):
    a.extend([0] * (n - len(a)))


def zero_remove(a, n):
    for _ in range(len(a) - n):
        a.pop()

class Fraction:
    def __init__(self, num, den):
        self.num = num
        self.den = den

    def __add__(self, other):
        a_num = self.num
        a_den = self.den
        b_num = other.num
        b_den = other.den

        n2 = max(len(a_num) + len(b_num) - 1, 1)
        n = 1 << (n2-1).bit_length()
        zero_pad(a_num, n)
        zero_pad(a_den, n)
        zero_pad(b_num, n)
        zero_pad(b_den, n)

        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_num, w)
        fft_inplace(a_den, w)
        fft_inplace(b_num, w)
        fft_inplace(b_den, w)

        c_num = [(a * d + b * c) % mod for a, b, c, d in zip(a_num, a_den, b_num, b_den)]
        c_dem = [a * b % mod for a, b in zip(a_den, b_den)]

        ifft_inplace(c_num, w)
        ifft_inplace(c_dem, w)

        zero_remove(c_num, n)
        zero_remove(c_dem, n)

        return Fraction(c_num, c_dem)


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([0, i ** 2 % mod], [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[i] * factorial % mod
    factorial = factorial * (i + 2) % mod
    ans %= mod

print(ans)
0