Submission #73310770

---

Source Code Expand

import sys
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mii = lambda: map(int, input().split())
lii = lambda: list(mii())
mod = 10**9+7
inf = 1<<60
def mul(a, b):
    n = len(a)
    res = [[inf] * n for _ in range(n)]
    for i in range(n):
        for k in range(n):
            if a[i][k] == inf:
                continue
            for j in range(n):
                if b[k][j] != inf:
                    res[i][j] = min(res[i][j],a[i][k]+b[k][j])
    return res

def pow_mul(a, k):
    n = len(a)
    res = [[inf] * n for _ in range(n)]
    for i in range(n):
        res[i][i] = 0
    while k > 0:
        if k & 1:
            res = mul(res, a)
        a = mul(a, a)
        k >>= 1
    return res
def solve():
    n,k = mii()
    a = [lii() for i in range(n)]
    mk = pow_mul(a,k)
    for i in range(n):
        print(mk[i][i])
t = 1
for i in range(t):
    solve()

Submission Info

Judge Result