結果
問題 | No.2529 Treasure Hunter |
ユーザー | mkawa2 |
提出日時 | 2023-11-03 22:40:07 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 204 ms / 2,000 ms |
コード長 | 1,667 bytes |
コンパイル時間 | 924 ms |
コンパイル使用メモリ | 81,848 KB |
実行使用メモリ | 79,268 KB |
最終ジャッジ日時 | 2023-11-03 22:40:10 |
合計ジャッジ時間 | 2,881 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
59,676 KB |
testcase_01 | AC | 204 ms
79,268 KB |
testcase_02 | AC | 89 ms
76,400 KB |
testcase_03 | AC | 94 ms
76,436 KB |
testcase_04 | AC | 86 ms
76,344 KB |
testcase_05 | AC | 89 ms
76,404 KB |
testcase_06 | AC | 85 ms
76,104 KB |
testcase_07 | AC | 90 ms
76,404 KB |
testcase_08 | AC | 87 ms
76,124 KB |
testcase_09 | AC | 85 ms
76,344 KB |
testcase_10 | AC | 90 ms
76,412 KB |
testcase_11 | AC | 100 ms
76,432 KB |
testcase_12 | AC | 38 ms
53,608 KB |
testcase_13 | AC | 38 ms
53,608 KB |
testcase_14 | AC | 39 ms
53,608 KB |
testcase_15 | AC | 38 ms
53,608 KB |
testcase_16 | AC | 38 ms
53,608 KB |
testcase_17 | AC | 37 ms
53,608 KB |
testcase_18 | AC | 38 ms
53,608 KB |
testcase_19 | AC | 38 ms
53,608 KB |
testcase_20 | AC | 38 ms
53,608 KB |
testcase_21 | AC | 38 ms
53,608 KB |
testcase_22 | AC | 38 ms
53,608 KB |
ソースコード
import sys # sys.setrecursionlimit(1000005) # sys.set_int_max_str_digits(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-(-1 << 31) inf = -1-(-1 << 63) # md = 10**9+7 md = 998244353 def dot(aa, bb): h = len(aa) w = len(bb[0]) res = [[0]*w for _ in range(h)] for j, col in enumerate(zip(*bb)): for i in range(h): v = 0 # for a, b in zip(row, col): v += a*b # res[i][j] = v for a, b in zip(aa[i], col): v += a*b%md res[i][j] = v%md return res def matpow(mat, e): n = len(mat) res = [[1 if i == j else 0 for j in range(n)] for i in range(n)] while e: if e & 1: res = dot(res, mat) mat = dot(mat, mat) e >>= 1 return res def solve(): w, h = LI() if w == 2: mat = [[1, 2, 0], [1, 1, 0], [0, 0, 0]] else: c = w*(w-1)//2-w mat = [[1, w, c], [1, w-1, c-w+3], [1, w-2, c-2*(w-3)+1]] mat = matpow(mat, h) print(sum(mat[0])%md) for _ in range(II()): solve()