結果
問題 | No.840 ほむほむほむら |
ユーザー | mkawa2 |
提出日時 | 2023-02-27 15:32:56 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,073 ms / 4,000 ms |
コード長 | 1,827 bytes |
コンパイル時間 | 1,189 ms |
コンパイル使用メモリ | 86,940 KB |
実行使用メモリ | 84,728 KB |
最終ジャッジ日時 | 2023-10-13 00:57:33 |
合計ジャッジ時間 | 15,901 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 82 ms
76,100 KB |
testcase_01 | AC | 85 ms
76,180 KB |
testcase_02 | AC | 126 ms
77,008 KB |
testcase_03 | AC | 352 ms
77,916 KB |
testcase_04 | AC | 83 ms
76,024 KB |
testcase_05 | AC | 84 ms
76,028 KB |
testcase_06 | AC | 92 ms
76,220 KB |
testcase_07 | AC | 178 ms
77,052 KB |
testcase_08 | AC | 574 ms
78,988 KB |
testcase_09 | AC | 91 ms
76,040 KB |
testcase_10 | AC | 85 ms
76,040 KB |
testcase_11 | AC | 100 ms
76,604 KB |
testcase_12 | AC | 234 ms
77,400 KB |
testcase_13 | AC | 1,365 ms
82,092 KB |
testcase_14 | AC | 265 ms
77,744 KB |
testcase_15 | AC | 84 ms
76,056 KB |
testcase_16 | AC | 107 ms
76,868 KB |
testcase_17 | AC | 416 ms
78,580 KB |
testcase_18 | AC | 1,722 ms
83,724 KB |
testcase_19 | AC | 2,073 ms
84,728 KB |
testcase_20 | AC | 76 ms
71,428 KB |
testcase_21 | AC | 84 ms
76,020 KB |
testcase_22 | AC | 112 ms
76,820 KB |
testcase_23 | AC | 1,981 ms
84,440 KB |
testcase_24 | AC | 110 ms
76,808 KB |
testcase_25 | AC | 80 ms
76,124 KB |
testcase_26 | AC | 124 ms
76,884 KB |
testcase_27 | AC | 1,981 ms
84,332 KB |
ソースコード
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 n, k = LI() k2 = k**2 k3 = k**3 mat = [[0]*k3 for _ in range(k3)] def pack(a, b, c): return c*k2+b*k+a def unpack(abc): bc, a = divmod(abc, k) c, b = divmod(bc, k) return a, b, c for s in range(k3): a, b, c = unpack(s) t = pack((a+1)%k, b, c) mat[s][t] += 1 t = pack(a, (a+b)%k, c) mat[s][t] += 1 t = pack(a, b, (b+c)%k) mat[s][t] += 1 def dot(aa, bb): h = len(aa) w = len(bb[0]) res = [[0]*w for _ in range(h)] for i, row in enumerate(aa): for j, col in enumerate(zip(*bb)): v = 0 # for a, b in zip(row, col): v += a*b # res[i][j] = v for a, b in zip(row, 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 mat = matpow(mat, n) ans = 0 for s in range(k3): a, b, c = unpack(s) if c == 0: ans += mat[0][s] ans %= md print(ans)