Submission #7085112

---

Source Code Expand

n,m = map(int,input().split())
dp = [[10**10]*n for i in range(n)]
for i in range(n):
    dp[i][i] = 0

for i in range(m):
    a,b,t = map(int,input().split())
    a -= 1
    b -= 1
    dp[a][b] = t
    dp[b][a] = t

for i in range(n):
    for j in range(n):
        for k in range(n):
            dp[j][k] = min(dp[j][k],dp[j][i] + dp[i][k])


ans = 10**10
for i in range(n):
    ans = min(ans,max(dp[i]))

print(ans)

Submission Info

Judge Result