Submission #4031999

---

Source Code Expand

#include <iostream>
using namespace std;

int N,M,a,b,t;
int d[310][310] = {};

int main(){
	cin >> N >> M;
	for(int i=1;i<=N;i++){
		for(int j=1;j<=N;j++){
			if(i!=j) d[i][j] = 1e9;
		}
	}
	for(int i=0;i<M;i++){
		cin >> a >> b >> t;
		d[a][b] = t;
		d[b][a] = t;
	}
	for(int k=1;k<=N;k++){
		for(int i=1;i<=N;i++){
			for(int j=1;j<=N;j++){
				d[i][j] = min(d[i][j],d[i][k]+d[k][j]);
			}
		}
	}
	int ans = 1e9;
	for(int i=1;i<=N;i++){
		int now = 0;
		for(int j=1;j<=N;j++){
			if(d[i][j]>now){
				now = d[i][j];
			}
		}
		if(now<ans){
			ans = now;
		}
	}
	cout << ans << endl;
}

Submission Info

Judge Result