Submission #1585924

---

Source Code Expand

n,m=map(int,input().split())
costs=[[99999 if i!=j else 0 for j in range(n)] for i in range(n)]
for _ in range(m):
    a,b,t=map(int,input().split())
    costs[a-1][b-1]=costs[b-1][a-1]=t
for k in range(n):
    costs=[[min(costs[i][j],costs[i][k]+costs[k][j]) for j in range(n)] for i in range(n)]
print(min(map(max,costs)))

Submission Info

Judge Result