結果

問題 No.1750 ラムドスウイルスの感染拡大-hard
ユーザー NatsubiSogan
提出日時 2021-11-20 16:12:32
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 2,559 bytes
コンパイル時間 248 ms
コンパイル使用メモリ 82,432 KB
実行使用メモリ 138,112 KB
最終ジャッジ日時 2024-06-11 17:39:23
合計ジャッジ時間 8,695 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 10 TLE * 1 -- * 19
権限があれば一括ダウンロードができます

ソースコード

diff # 

import typing

class Matrix:
	def __init__(self, n: int, m: int, mat: typing.Union[list, None] = None, mod: int = 998244353) -> 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(n):
		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]
			for i in range(self.n):
				for j in range(other.m):
						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 = Matrix(n, n)
		for i in range(n):
			res[i][i] = 1
		while k:
			if k & 1:
				res *= tmp
			tmp *= tmp
			k >>= 1
		return res

n, m, t = map(int, input().split())
G = [[0] * n for i in range(n)]
for _ in range(m):
	a, b = map(int, input().split())
	G[a][b] = 1
	G[b][a] = 1
G = Matrix(n, n, G)
G **= t
b = [[0] * n for i in range(n)]
b[0][0] = 1
G *= Matrix(n, n, b)
print(G.mat[0][0])
0