結果
問題 | No.2164 Equal Balls |
ユーザー | mkawa2 |
提出日時 | 2022-12-19 18:33:51 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 5,847 bytes |
コンパイル時間 | 168 ms |
コンパイル使用メモリ | 82,712 KB |
実行使用メモリ | 285,200 KB |
最終ジャッジ日時 | 2024-04-29 02:21:20 |
合計ジャッジ時間 | 20,431 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 64 ms
72,448 KB |
testcase_01 | AC | 55 ms
72,576 KB |
testcase_02 | AC | 59 ms
74,240 KB |
testcase_03 | AC | 56 ms
72,832 KB |
testcase_04 | AC | 57 ms
72,624 KB |
testcase_05 | AC | 60 ms
73,720 KB |
testcase_06 | AC | 58 ms
72,448 KB |
testcase_07 | AC | 62 ms
72,576 KB |
testcase_08 | AC | 456 ms
91,860 KB |
testcase_09 | AC | 550 ms
111,564 KB |
testcase_10 | AC | 170 ms
79,580 KB |
testcase_11 | AC | 1,490 ms
181,548 KB |
testcase_12 | AC | 456 ms
94,772 KB |
testcase_13 | AC | 274 ms
83,556 KB |
testcase_14 | AC | 366 ms
88,796 KB |
testcase_15 | AC | 1,341 ms
169,376 KB |
testcase_16 | AC | 489 ms
99,068 KB |
testcase_17 | AC | 133 ms
78,848 KB |
testcase_18 | AC | 663 ms
108,916 KB |
testcase_19 | AC | 2,301 ms
278,144 KB |
testcase_20 | AC | 564 ms
103,412 KB |
testcase_21 | AC | 109 ms
78,912 KB |
testcase_22 | AC | 102 ms
78,896 KB |
testcase_23 | AC | 164 ms
115,280 KB |
testcase_24 | AC | 141 ms
94,404 KB |
testcase_25 | AC | 139 ms
110,976 KB |
testcase_26 | AC | 133 ms
79,232 KB |
testcase_27 | AC | 150 ms
99,316 KB |
testcase_28 | AC | 161 ms
99,572 KB |
testcase_29 | AC | 112 ms
86,860 KB |
testcase_30 | AC | 148 ms
99,840 KB |
testcase_31 | AC | 170 ms
122,112 KB |
testcase_32 | AC | 160 ms
102,780 KB |
testcase_33 | AC | 127 ms
99,868 KB |
testcase_34 | AC | 153 ms
110,080 KB |
testcase_35 | AC | 91 ms
80,188 KB |
testcase_36 | AC | 209 ms
128,128 KB |
testcase_37 | AC | 181 ms
134,548 KB |
testcase_38 | TLE | - |
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 | -- | - |
ソースコード
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 l, r = -300, 300 for j in range(si, n, m): a, b = aa[j], bb[j] L = max(l, -a) R = min(r, b) d1, d2 = L-l, L+a ndp = [] for i in range(R-L+1): ndp.append(dp[i+d1]*cc[a+b][i+d2]%md) dp = ndp l, r = L, R mid -= l sc = multiply(sc, dp)[:lim*2+1] # pDB(sc) print(sc[mid])