Submission #423438

---

Source Code Expand

N,M = map(int,raw_input().split())
RootTime = [map(int,raw_input().split()) for _ in range(M)]

wf = [[float('inf') for j in range(N)] for i in range(N)]

for i in range(M):
	wf[RootTime[i][0]-1][RootTime[i][1]-1] = RootTime[i][2]
	wf[RootTime[i][1]-1][RootTime[i][0]-1] = RootTime[i][2]

for k in range(N):
	for i in range(N):
		for j in range(N):
			wf[i][j] = min(wf[i][j],wf[i][k]+wf[k][j])

for i in range(N):
	for j in range(N):
		if wf[i][j] == float('inf') or i==j:wf[i][j] = -1

badcase = [max(x) for x in wf]
print min(badcase)

Submission Info

Judge Result