Submission #3045043

---

Source Code Expand

h,w = map(int,input().split())
g = [[] for _ in range(0,10)]
for i in range(0,10):
    a = list(map(int,input().split()))
    for j in range(0,10):
        g[i].append((j,a[j]))

def dijkstra(s):
    d = [float("inf") for _ in range(0,10)]
    d[s] = 0
    q = []
    q.append((s,g[s]))
    while len(q) > 0:
        start,edge = q.pop(0)
        for to,cost in edge:
            if d[to] > d[start] + cost:
                d[to] = d[start] + cost
                q.append((to,g[to]))
    return d[1]

d = []
for i in range(0,10):
    d.append(dijkstra(i))
ans = 0
for i in range(0,h):
    a = list(map(int,input().split()))
    for j in range(0,w):
        if a[j] != -1:
            ans += d[a[j]]
print(ans)

Submission Info

Judge Result