Submission #2857139

---

Source Code Expand

#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
#include <iomanip>

#define ll long long int
#define pb push_back
#define mk make_pair
#define pq priority_queue

using namespace std;
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
const int inf = 1e9;
const ll linf = 1LL << 50;

int n, m;

int e[301][301];

int main(int argc, char const* argv[])
{
	cin >> n >> m;
	for(int i = 0; i < n; i++){
			for(int j = 0; j < n; j++)e[i][j] = inf;
			e[i][i] = 0;
	}
	for(int i = 0; i < m; i++){
			int a, b, c;
			cin >> a >> b >> c;
			e[a-1][b-1] = c;
			e[b-1][a-1] = c;
	}
	for(int k = 0; k < n; k++){
			for(int i = 0; i < n; i++){
					for(int j = 0; j < n; j++){
							e[i][j] = min(e[i][j], e[i][k] + e[k][j]);
					}
			}
	}
	int res = inf;
	for(int i = 0; i < n; i++){
			int tmp = -1;
			for(int j = 0; j < n; j++)tmp = max(tmp, e[i][j]);
			res = min(res, tmp);
	}
	cout << res << endl;
	return 0;
}

Submission Info

Judge Result