Submission #1594207

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

int d[310][310];

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

int main(void) {
  int n, m;
  cin >> n >> m;

  const int INF = 1e9;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      d[i][j] = INF;
    }
    d[i][i] = 0;
  }

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

  warshallFloyd(n);

  int ans = INF;
  for (int i = 0; i < n; i++) {
    int t = 0;
    for (int j = 0; j < n; j++) {
      t = max(t, d[i][j]);
    }
    ans = min(ans, t);
  }

  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result