Submission #1678795

---

Source Code Expand

import numpy as np

N, M = map(int, input().split(' '))
G = np.zeros([N, N], np.int8)
for i in range(M):
    a, b, t = map(int, input().split(' '))
    G[a - 1, b - 1] = t
    G[b - 1, a - 1] = t

for p in range(N):
    for i in np.nonzero(G[:-1, p])[0]:
        for j in np.nonzero(G[i + 1:, p])[0]:
            if G[i, i + 1 + j] == 0 or G[i, p] + G[p, i + 1 + j] <= G[i, i + 1 + j]:
                G[i, i + 1 + j] = G[i + 1 + j, i] = G[i, p] + G[p, i + 1 + j]
print(np.min(np.max(G, axis=0)))

Submission Info

Judge Result