Submission #202457

---

Source Code Expand

#include <iostream>
using namespace std;

int d[300][300];

int main() {
  for (int i = 0; i < 300; ++i)
    for (int j = 0; j < 300; ++j)
      d[i][j] = i == j ? 0 : 300000;
  int n,m;
  cin >> n >> m;
  for (int i = 0; i < m; ++i) {
    int a,b,t;
    cin >> a >> b >> t;
    d[a-1][b-1] = t;
    d[b-1][a-1] = t;
  }

  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 worst = 300000;
  for (int i = 0; i < n; ++i) {
    int i_worst = 0;
    for (int j = 0; j < n; ++j)
      i_worst = max(i_worst, d[i][j]);
    worst = min(worst, i_worst);
  }
  cout << worst << endl;
}

Submission Info

Judge Result