Submission #1590750

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <list>
#include <string>
#include <map>
#include <numeric>
#include <queue>
#include <stack>

using namespace std;
using ll = long long;

int main() {

	/*/
	cin >> A >> B;
	for (int i = 0; i < A; i++)cin >> a[i];
	for (int i = 0; i < B; i++)cin >> b[i];

	memset(dp, -1, sizeof(dp));

	dp[0][0] = 0;

	cout << rec(0, 0) << endl;


	for (int i = 0; i < A; i++) {
		for (int j = 0; j < B; j++) {
			cout << dp[i][j] << ' ';
		}
		cout << endl;
	}

	:*/
	int dist[310][310];
	int mindist = 1010;
	int n, m;
	cin >> n >> m;

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			dist[i][j] = 1010;
		}
	}

	for (int i = 0; i < m; i++) {
		int a, b, t;
		cin >> a >> b >> t;
		a--; b--;
		dist[a][b] = dist[b][a] = t;
	}

	for (int k = 0; k < n; k++) {
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
			}
		}
	}

	for (int i = 0; i < n; i++) {
		int a = 0;
		for (int j = 0; j < n; j++) {
			a = max(a, dist[i][j]);
		}
		mindist = min(mindist, a);
	}

	cout << mindist << endl;

	return 0;
}

Submission Info

Judge Result