結果
問題 | No.2164 Equal Balls |
ユーザー | mkawa2 |
提出日時 | 2022-12-19 11:13:28 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 1,578 bytes |
コンパイル時間 | 249 ms |
コンパイル使用メモリ | 82,560 KB |
実行使用メモリ | 127,912 KB |
最終ジャッジ日時 | 2024-04-29 02:08:40 |
合計ジャッジ時間 | 7,116 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
63,872 KB |
testcase_01 | AC | 44 ms
63,616 KB |
testcase_02 | AC | 56 ms
69,760 KB |
testcase_03 | AC | 42 ms
63,616 KB |
testcase_04 | AC | 46 ms
65,504 KB |
testcase_05 | AC | 50 ms
67,072 KB |
testcase_06 | AC | 43 ms
64,128 KB |
testcase_07 | AC | 42 ms
64,108 KB |
testcase_08 | RE | - |
testcase_09 | RE | - |
testcase_10 | RE | - |
testcase_11 | RE | - |
testcase_12 | RE | - |
testcase_13 | RE | - |
testcase_14 | RE | - |
testcase_15 | RE | - |
testcase_16 | RE | - |
testcase_17 | RE | - |
testcase_18 | RE | - |
testcase_19 | RE | - |
testcase_20 | RE | - |
testcase_21 | RE | - |
testcase_22 | RE | - |
testcase_23 | RE | - |
testcase_24 | RE | - |
testcase_25 | RE | - |
testcase_26 | RE | - |
testcase_27 | RE | - |
testcase_28 | RE | - |
testcase_29 | RE | - |
testcase_30 | RE | - |
testcase_31 | RE | - |
testcase_32 | RE | - |
testcase_33 | RE | - |
testcase_34 | RE | - |
testcase_35 | RE | - |
testcase_36 | RE | - |
testcase_37 | RE | - |
testcase_38 | RE | - |
testcase_39 | RE | - |
testcase_40 | RE | - |
testcase_41 | RE | - |
testcase_42 | RE | - |
testcase_43 | RE | - |
testcase_44 | RE | - |
testcase_45 | RE | - |
testcase_46 | RE | - |
testcase_47 | RE | - |
testcase_48 | RE | - |
testcase_49 | RE | - |
testcase_50 | RE | - |
testcase_51 | RE | - |
testcase_52 | RE | - |
testcase_53 | RE | - |
ソースコード
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 from collections import defaultdict cc = [] for i in range(301): 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+1 ans = 1 sc = defaultdict(int) sc[0] = 1 for si in range(m): dp = defaultdict(lambda: -1) for i in range(si, n, m): a, b = aa[i], bb[i] i = -a ndp = defaultdict(int) for c in cc[a+b]: if dp[i] == -1: ndp[i] = c else: ndp[i] = dp[i]*c%md i += 1 dp = ndp # pDB(i, a, b, dp) nsc = defaultdict(int) for d, v in dp.items(): for s, c in sc.items(): if -lim <= s+d <= lim: nsc[s+d] += v*c%md nsc[s+d] %= md sc = nsc print(sc[0])