結果

問題 No.2164 Equal Balls
ユーザー mkawa2mkawa2
提出日時 2022-12-19 12:24:59
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 5,841 bytes
コンパイル時間 177 ms
コンパイル使用メモリ 82,560 KB
実行使用メモリ 301,124 KB
最終ジャッジ日時 2024-04-29 02:12:09
合計ジャッジ時間 45,167 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 103 ms
78,576 KB
testcase_01 AC 95 ms
78,352 KB
testcase_02 AC 102 ms
79,088 KB
testcase_03 AC 90 ms
78,688 KB
testcase_04 AC 101 ms
78,916 KB
testcase_05 AC 100 ms
79,100 KB
testcase_06 AC 96 ms
79,104 KB
testcase_07 AC 95 ms
78,768 KB
testcase_08 AC 1,338 ms
234,440 KB
testcase_09 AC 928 ms
176,384 KB
testcase_10 AC 356 ms
95,192 KB
testcase_11 AC 3,989 ms
290,756 KB
testcase_12 AC 1,502 ms
248,468 KB
testcase_13 AC 806 ms
156,240 KB
testcase_14 AC 1,109 ms
205,708 KB
testcase_15 AC 3,744 ms
289,780 KB
testcase_16 AC 1,202 ms
213,948 KB
testcase_17 AC 208 ms
86,588 KB
testcase_18 AC 2,336 ms
288,440 KB
testcase_19 AC 4,388 ms
289,936 KB
testcase_20 AC 1,823 ms
287,064 KB
testcase_21 AC 156 ms
80,532 KB
testcase_22 AC 149 ms
80,072 KB
testcase_23 AC 1,243 ms
134,892 KB
testcase_24 TLE -
testcase_25 AC 770 ms
110,712 KB
testcase_26 TLE -
testcase_27 TLE -
testcase_28 -- -
testcase_29 -- -
testcase_30 -- -
testcase_31 -- -
testcase_32 -- -
testcase_33 -- -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
testcase_39 -- -
testcase_40 -- -
testcase_41 -- -
testcase_42 -- -
testcase_43 -- -
testcase_44 -- -
testcase_45 -- -
testcase_46 -- -
testcase_47 -- -
testcase_48 -- -
testcase_49 -- -
testcase_50 -- -
testcase_51 -- -
testcase_52 -- -
testcase_53 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 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)%md
                    a[i+offset+p] = (l-r)%md
                rot *= rate2[(~s & -~s).bit_length()]
                rot %= md
            le += 1
        else:
            p = 1 << (h-le-2)
            rot = 1
            for s in range(1 << le):
                rot2 = rot*rot%md
                rot3 = rot2*rot%md
                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)%md*IMAG
                    a[i+offset] = (a0+a2+a1+a3)%md
                    a[i+offset+p] = (a0+a2-a1-a3)%md
                    a[i+offset+p*2] = (a0-a2+a1na3imag)%md
                    a[i+offset+p*3] = (a0-a2-a1na3imag)%md
                rot *= rate3[(~s & -~s).bit_length()]
                rot %= md
            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)%md
                    a[i+offset+p] = (l-r)*irot%md
                irot *= irate2[(~s & -~s).bit_length()]
                irot %= md
            le -= 1
        else:
            p = 1 << (h-le)
            irot = 1
            for s in range(1 << (le-2)):
                irot2 = irot*irot%md
                irot3 = irot2*irot%md
                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%md
                    a[i+offset] = (a0+a1+a2+a3)%md
                    a[i+offset+p] = (a0-a1+a2na3iimag)*irot%md
                    a[i+offset+p*2] = (a0+a1-a2-a3)*irot2%md
                    a[i+offset+p*3] = (a0-a1-a2na3iimag)*irot3%md
                irot *= irate3[(~s & -~s).bit_length()]
                irot %= md
            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] %= md
            else:
                for j in range(m):
                    a[i+j] += s[i]*t[j]
        return [x%md 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] %= md
    butterfly_inv(a)
    a = a[:n+m-1]
    iz = pow(z, md-2, md)
    return [v*iz%md for v in a]

from collections import defaultdict

cc = []
for i in range(601):
    cc.append([1])
    for j in range(1, i):
        cc[i].append((cc[i-1][j-1]+cc[i-1][j])%md)
    cc[i].append(1)
# p2D(cc)

n, m = LI()
aa = LI()
bb = LI()
lim = 300*150

ans = 1
sc = [1]
mid = 0
for si in range(m):
    dp = [-1]*601
    for j in range(si, n, m):
        a, b = aa[j], bb[j]
        i = -a+300
        ndp = [0]*601
        for c in cc[a+b]:
            if dp[i] == -1:
                ndp[i] = c
            elif dp[i]:
                ndp[i] = dp[i]*c%md
            i += 1
        dp = ndp

    mid += 300
    sc = multiply(sc, dp)[:lim*2+1]
# pDB(sc)

print(sc[mid])
0