Submission #1773922

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <bitset>
#include <climits>
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define RFOR(i,a,b) for (int i=(a)-1;i>=(b);i--)
#define ll long long
#define ull unsigned long long
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const int INF = 1e9;
const int MOD = 1e9 + 7;

using namespace std;

struct Edge{
  int u, v, t;
};

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  int N, M;
  cin >> N >> M;
  vector<vector<int> > dist(N,vector<int>(N, INF));
  REP(i,M){
    int a, b, t;
    cin >> a >> b >> t;
    -- a;
    -- b;
    dist[a][b] = t;
    dist[b][a] = t;
  }
  REP(k,N){
    REP(i,N){
      REP(j,N){
        dist[i][j] = min(dist[i][k] + dist[k][j], dist[i][j]);
      }
    }
  }
  int ans = INF;
  REP(i,N){
    int res = 0;
      REP(j,N){
        if(i == j) continue;
        res = max(res, dist[i][j]);
      }
      ans = min(ans, res);
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result