Submission #3249261

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;
typedef long long  ll;
#define rep(i,s,n)for(ll i=s;i<n;i++)
#define repe(i,s,n)for(ll i=s;i<=n;i++)

ll n;
ll x[300][300] = {};
void wf() {
	rep(k, 0, n) rep(i, 0, n) 	rep(j, 0, n) x[i][j] = min(x[i][j], x[i][k] + x[k][j]);
}

int main() {
	ll  m; cin >> n >> m;
	rep(i, 0, n)rep(j, 0, n) x[i][j] = 1e16;

	rep(i, 0, m) {
		ll a, b, t; cin >> a >> b >> t;
		a--; b--;
		x[a][b] = t;
		x[b][a] = t;
	}

	wf();

	ll minV = 1e16;
	rep(i, 0, n) {
		ll maxV = 0;
		rep(j, 0, n) {
			if (i != j)	maxV = max(maxV, x[i][j]);
		}
		minV = min(minV, maxV);
	}
	cout << minV << endl;
	return 0;
}

Submission Info

Judge Result