結果

問題 No.1750 ラムドスウイルスの感染拡大-hard
コンテスト
ユーザー Navier_Boltzmann
提出日時 2022-01-03 07:03:31
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,772 ms / 2,000 ms
コード長 3,292 bytes
コンパイル時間 905 ms
コンパイル使用メモリ 82,328 KB
実行使用メモリ 77,992 KB
最終ジャッジ日時 2024-10-12 14:19:45
合計ジャッジ時間 19,874 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff # 

class Matrix():
    def __init__(self, n, m ,mat=None,mod=998244353):
        self.n = n
        self.m = m
        self.MOD = mod
        self.mat = [[0] * self.m for _ in range(self.n)]
        if mat:
            assert len(mat) == n and len(mat[0]) == m
            for i in range(self.n):
                self.mat[i] = mat[i].copy()

    def is_square(self):
        return self.n == self.m

    def __getitem__(self, key):
        if isinstance(key, slice):
            return self.mat[key]
        else:
            assert key >= 0
            return self.mat[key]

    def id(n):
        res = Matrix(n, n)
        for i in range(n):
            res[i][i] = 1
        return res

    def __len__(self):
        return len(self.mat)

    def __str__(self):
        return '\n'.join(' '.join(map(str, self[i])) for i in range(self.n))

    def times(self, k):
        res = [[0] * self.m for _ in range(self.n)]
        for i in range(self.n):
            res_i, self_i = res[i], self[i]
            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):
        return self

    def __neg__(self):
        return self.times(-1)

    def __add__(self, other):
        assert self.n == other.n and self.m == other.m
        res = [[0] * self.m for _ in range(self.n)]
        for i in range(self.n):
            res_i, self_i, other_i = res[i], self[i], other[i]
            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):
        assert self.n == other.n and self.m == other.m
        res = [[0] * self.m for _ in range(self.n)]
        for i in range(self.n):
            res_i, self_i, other_i = res[i], self[i], other[i]
            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):
        if other.__class__ == Matrix:
            assert self.m == other.n
            res = [[0] * other.m for _ in range(self.n)]
            for i in range(self.n):
                res_i, self_i = res[i], self[i]
                for k in range(self.m):
                    self_ik, other_k = self_i[k], other[k]
                    for j in range(other.m):
                        res_i[j] += self_ik * other_k[j]
                        res_i[j] %= self.MOD
            return Matrix(self.n, other.m, res)
        else:
            return self.times(other)

    def __rmul__(self, other):
        return self.times(other)

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

N,M,T = map(int,input().split())
e = [[] for _ in range(N)]
for _ in range(M):
    s,t = map(int,input().split())
    e[s].append(t)
    e[t].append(s)
    
mod = 998244353
    
S = [[0]*N for _ in range(N)]
for i in range(N):
    for j in e[i]:
        S[i][j] = 1
S = Matrix(N,N,S,mod)
tS = S**T
B = [[0] for _ in range(N)]
B[0] = [1]
B = Matrix(N,1,B,mod)
ans = tS*B
print(ans[0][0])
0