結果

問題 No.2966 Simple Plus Minus Problem
ユーザー 遭難者遭難者
提出日時 2024-10-29 15:52:25
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 384 ms / 2,567 ms
コード長 5,657 bytes
コンパイル時間 300 ms
コンパイル使用メモリ 82,768 KB
実行使用メモリ 117,900 KB
最終ジャッジ日時 2024-10-30 08:24:04
合計ジャッジ時間 13,834 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 38 ms
54,368 KB
testcase_01 AC 38 ms
53,168 KB
testcase_02 AC 38 ms
53,812 KB
testcase_03 AC 314 ms
115,132 KB
testcase_04 AC 333 ms
105,008 KB
testcase_05 AC 37 ms
53,736 KB
testcase_06 AC 54 ms
66,716 KB
testcase_07 AC 82 ms
76,840 KB
testcase_08 AC 67 ms
73,772 KB
testcase_09 AC 85 ms
77,452 KB
testcase_10 AC 54 ms
66,340 KB
testcase_11 AC 83 ms
76,812 KB
testcase_12 AC 55 ms
66,712 KB
testcase_13 AC 86 ms
77,164 KB
testcase_14 AC 55 ms
65,760 KB
testcase_15 AC 64 ms
71,460 KB
testcase_16 AC 40 ms
54,552 KB
testcase_17 AC 85 ms
76,952 KB
testcase_18 AC 63 ms
71,552 KB
testcase_19 AC 83 ms
76,904 KB
testcase_20 AC 84 ms
77,056 KB
testcase_21 AC 67 ms
71,500 KB
testcase_22 AC 56 ms
66,232 KB
testcase_23 AC 69 ms
74,672 KB
testcase_24 AC 98 ms
77,760 KB
testcase_25 AC 85 ms
76,988 KB
testcase_26 AC 87 ms
76,908 KB
testcase_27 AC 96 ms
77,856 KB
testcase_28 AC 72 ms
74,600 KB
testcase_29 AC 96 ms
78,104 KB
testcase_30 AC 69 ms
72,640 KB
testcase_31 AC 84 ms
76,804 KB
testcase_32 AC 38 ms
53,724 KB
testcase_33 AC 39 ms
54,724 KB
testcase_34 AC 219 ms
91,256 KB
testcase_35 AC 349 ms
105,024 KB
testcase_36 AC 236 ms
95,716 KB
testcase_37 AC 217 ms
93,084 KB
testcase_38 AC 324 ms
101,336 KB
testcase_39 AC 325 ms
102,000 KB
testcase_40 AC 233 ms
95,784 KB
testcase_41 AC 354 ms
108,148 KB
testcase_42 AC 325 ms
102,032 KB
testcase_43 AC 346 ms
104,940 KB
testcase_44 AC 346 ms
104,844 KB
testcase_45 AC 369 ms
117,412 KB
testcase_46 AC 361 ms
117,056 KB
testcase_47 AC 324 ms
101,620 KB
testcase_48 AC 348 ms
104,956 KB
testcase_49 AC 346 ms
105,116 KB
testcase_50 AC 230 ms
95,428 KB
testcase_51 AC 317 ms
98,520 KB
testcase_52 AC 384 ms
117,644 KB
testcase_53 AC 368 ms
117,356 KB
testcase_54 AC 364 ms
117,280 KB
testcase_55 AC 366 ms
117,596 KB
testcase_56 AC 367 ms
117,900 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

# AtCoder Libary v1.4 を python に移植したもの
# https://github.com/atcoder/ac-library/blob/master/atcoder/convolution.hpp

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())
mg = M % 2
M >>= 1
A = list(map(int, input().split()))
B = [0] * N
B[0] = 1
idx = 0
while 2 * idx + 2 < N:
    B[2 * idx + 2] = B[2 * idx] * (M + idx) * pow(idx + 1, MOD - 2, MOD) % MOD
    idx += 1
A = multiply(A, B)
if mg:
    for i in range(1 , N):
        if (i & 1) == 1:
            A[i] = -A[i]
        A[i] += A[i - 1]
        A[i] %= MOD
print(" ".join(map(str, A[:N])))
0