結果
問題 | No.1810 RGB Biscuits |
ユーザー | mkawa2 |
提出日時 | 2022-01-14 22:01:32 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 335 ms / 2,000 ms |
コード長 | 1,634 bytes |
コンパイル時間 | 179 ms |
コンパイル使用メモリ | 82,656 KB |
実行使用メモリ | 77,544 KB |
最終ジャッジ日時 | 2024-04-30 14:41:48 |
合計ジャッジ時間 | 4,276 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
54,576 KB |
testcase_01 | AC | 52 ms
64,632 KB |
testcase_02 | AC | 48 ms
59,868 KB |
testcase_03 | AC | 62 ms
68,820 KB |
testcase_04 | AC | 64 ms
71,808 KB |
testcase_05 | AC | 285 ms
76,932 KB |
testcase_06 | AC | 335 ms
77,180 KB |
testcase_07 | AC | 307 ms
77,544 KB |
testcase_08 | AC | 317 ms
77,444 KB |
testcase_09 | AC | 316 ms
77,060 KB |
testcase_10 | AC | 245 ms
77,276 KB |
testcase_11 | AC | 87 ms
76,508 KB |
testcase_12 | AC | 82 ms
76,304 KB |
testcase_13 | AC | 79 ms
75,788 KB |
testcase_14 | AC | 140 ms
77,216 KB |
testcase_15 | AC | 90 ms
76,896 KB |
testcase_16 | AC | 112 ms
77,468 KB |
testcase_17 | AC | 194 ms
77,456 KB |
testcase_18 | AC | 215 ms
77,488 KB |
testcase_19 | AC | 65 ms
70,164 KB |
testcase_20 | AC | 47 ms
61,912 KB |
testcase_21 | AC | 122 ms
76,972 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 = 18446744073709551615 # inf = 4294967295 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 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%md 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 A, B = LI() odd = [[1, 0, A], [0, 1, B], [0, 0, 1]] even = [[0, 1, 0], [0, 0, 0], [1, 0, 0]] oe = dot(odd, even) for _ in range(II()): t = II() p, r = divmod(t, 2) cc = matpow(oe, p) if r: cc = dot(cc, odd) s = dot([[1, 1, 0]], cc) ans = sum(s[0])%md print(ans)