Submission #2251903

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using pii = pair<int, int>;

const int INF = 1 << 30;

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  
  int N, M;
  cin >> N >> M;

  int dis[310][310];
  fill((int*)dis, (int*)(dis + N), INF);
  for (int i = 0; i < N; i++) dis[i][i] = 0;
  for (int i = 0; i < M; i++) {
    int a, b, t;
    cin >> a >> b >> t;
    a--, b--;
    dis[a][b] = dis[b][a] = t;
  }
  for (int k = 0; k < N; k++) for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) {
    if (dis[i][k] == INF || dis[k][j] == INF) continue;
    dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
  }
  int ans = INF;
  for (int i = 0; i < N; i++) {
    ans = min(ans, *max_element(dis[i], dis[i] + N));
  }
  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result