Submission #6905580

---

Source Code Expand

#include <algorithm>
#include <climits>
#include <functional>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
using namespace std;

int main() {
	int N, M, a, b, t, ans = INT_MAX;
	cin >> N >> M;
	vector<vector<pair<int, int>>> c(N);
	for (int i = 0; i < M; ++i) {
		cin >> a >> b >> t;
		c[a - 1].emplace_back(b - 1, t);
		c[b - 1].emplace_back(a - 1, t);
	}
	for (int i = 0; i < N; ++i) {
		priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> d;
		d.emplace(0, i);
		vector<bool> e(N);
		vector<int> f(N, INT_MAX);
		f[i] = 0;
		while (!d.empty()) {
			pair<int, int> g = d.top();
			d.pop();
			e[g.second] = true;
			for (int j = 0; j < c[g.second].size(); ++j) {
				if (!e[c[g.second][j].first]) {
					if (c[g.second][j].second + f[g.second] < f[c[g.second][j].first]) {
						f[c[g.second][j].first] = c[g.second][j].second + f[g.second];
						d.emplace(f[c[g.second][j].first], c[g.second][j].first);
					}
				}
			}
		}
		ans = min(*max_element(f.begin(), f.end()), ans);
	}
	cout << ans;
}

Submission Info

Judge Result