Submission #344381

---

Source Code Expand

#include<iostream>
#include<algorithm>
using namespace std;
#define rep(i,a,b) for(auto (i)=(a);(i)<(b);(i)++)
#define rev(i,a,b) for(auto (i)=(b)-1;(i)>=(a);(i)--)
#define INF 9999999
int d[300][300];
int main(void){
	int N, M, a, b, t, result = INF;
	cin >> N >> M;
	rep(i, 0, N)rep(j, 0, N)if (i != j)d[i][j] = INF;
	rep(i, 0, M){
		cin >> a >> b >> t; a--; b--;
		d[a][b] = d[b][a] = t;
	}
	rep(k, 0, N)rep(i, 0, N)rep(j, 0, N)d[i][j] = min(d[i][j], d[i][k] + d[k][j]);

	rep(i, 0, N){
		int T = 0;
		rep(j, 0, N)T = max(T, d[i][j]);
		result = min(result, T);
	}
	cout << result << endl;
}

Submission Info

Judge Result