結果

問題 No.1810 RGB Biscuits
ユーザー NatsubiSoganNatsubiSogan
提出日時 2022-01-14 23:14:13
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 379 ms / 2,000 ms
コード長 2,550 bytes
コンパイル時間 896 ms
コンパイル使用メモリ 87,072 KB
実行使用メモリ 84,056 KB
最終ジャッジ日時 2023-08-12 22:07:12
合計ジャッジ時間 8,172 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge2
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 169 ms
80,028 KB
testcase_01 AC 203 ms
82,668 KB
testcase_02 AC 174 ms
79,956 KB
testcase_03 AC 203 ms
82,400 KB
testcase_04 AC 204 ms
82,624 KB
testcase_05 AC 361 ms
83,804 KB
testcase_06 AC 379 ms
83,748 KB
testcase_07 AC 369 ms
84,056 KB
testcase_08 AC 371 ms
83,836 KB
testcase_09 AC 365 ms
83,812 KB
testcase_10 AC 334 ms
83,664 KB
testcase_11 AC 211 ms
82,100 KB
testcase_12 AC 220 ms
83,168 KB
testcase_13 AC 224 ms
83,268 KB
testcase_14 AC 268 ms
83,036 KB
testcase_15 AC 230 ms
83,104 KB
testcase_16 AC 242 ms
83,868 KB
testcase_17 AC 309 ms
84,048 KB
testcase_18 AC 336 ms
83,716 KB
testcase_19 AC 199 ms
82,588 KB
testcase_20 AC 175 ms
79,904 KB
testcase_21 AC 263 ms
83,800 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import typing

class Matrix:
	def __init__(self, n: int, m: int, mat: typing.Union[list, None] = None, mod: int = 10 ** 9 + 7) -> None:
		self.n = n
		self.m = m
		self.mat = [[0] * self.m for i in range(self.n)]
		self.mod = mod
		if mat:
			for i in range(self.n):
				self.mat[i] = mat[i]
	
	def is_square(self) -> None:
		return self.n == self.m
	
	def __getitem__(self, key: int) -> int:
		if isinstance(key, slice):
			return self.mat[key]
		else:
			assert key >= 0
			return self.mat[key]

	@classmethod
	def id(self, n: int) -> "Matrix":
		res = Matrix(n, n)
		for i in range(n):
			res[i][i] = 1
		return res

	def __len__(self) -> int:
		return len(self.mat)
	
	def __str__(self) -> str:
		return "\n".join(" ".join(map(str, self[i])) for i in range(self.n))

	def times(self, k: int) -> "Matrix":
		res = [[0] * self.m for i in range(self.n)]
		for i in range(self.n):
			for j in range(self.m):
				res[i][j] = k * self[i][j] % self.mod
		return Matrix(self.n, self.m, res)

	def __pos__(self) -> "Matrix":
		return self

	def __neg__(self) -> "Matrix":
		return self.times(-1)

	def __add__(self, other: "Matrix") -> "Matrix":
		res = [[0] * self.m for i in range(self.n)]
		for i in range(self.n):
			for j in range(self.m):
				res[i][j] = (self[i][j] + other[i][j]) % self.mod
		return Matrix(self.n, self.m, res)
	
	def __sub__(self, other: "Matrix") -> "Matrix":
		res = [[0] * self.m for i in range(self.n)]
		for i in range(self.n):
			for j in range(self.m):
				res[i][j] = (self[i][j] - other[i][j]) % self.mod
		return Matrix(self.n, self.m, res)

	def __mul__(self, other: typing.Union["Matrix", int]) -> "Matrix":
		if other.__class__ == Matrix:
			res = [[0] * other.m for i in range(self.n)]
			for i in range(self.n):
				for k in range(self.m):
					for j in range(other.m):
						res[i][j] += self[i][k] * other[k][j]
						res[i][j] %= self.mod
			return Matrix(self.n, other.m, res)
		else:
			return self.times(other)
	
	def __rmul__(self, other: typing.Union["Matrix", int]) -> "Matrix":
		return self.times(other)

	def __pow__(self, k: int) -> "Matrix":
		tmp = Matrix(self.n, self.n, self.mat)
		res = self.id(self.n)
		while k:
			if k & 1:
				res *= tmp
			tmp *= tmp
			k >>= 1
		return res

A, B = map(int, input().split())
n = int(input())
for _ in range(n):
	t = int(input())
	x = Matrix(2, 1, [[1], [1]])
	M = Matrix(2, 2, [[A, B], [1, 0]])
	if t <= 1: ans = x[:]
	else: ans = (M ** (t // 2)) * x
	r, g = ans[0][0], ans[1][0]
	if t % 2: b = A * r + B * g
	else: b = 0
	print((r + g + b) % (10 ** 9 + 7))
0