Submission #3249238

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
const int IINF = INT_MAX;
#define REP(i, n) for (int i = 0; i < n; i++)

int main() {
    int n, m, d[305][305];
    cin >> n >> m;
    REP(i,n)fill(d[i],d[i]+n,IINF/2);
    REP(i,m){
        int a, b, t;
        cin >> a >> b >> t;
        a--;
        b--;
        d[a][b] = t;
        d[b][a] = t;
    }
    REP(k,n)REP(i,n)REP(j,n)d[i][j] = min(d[i][j],d[i][k]+d[k][j]);
    int ans = IINF;
    REP(i,n){
        int tmp = 0;
        REP(j,n){
            if(i==j)continue;
            tmp = max(tmp,d[i][j]);
        }
        ans = min(ans, tmp);
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result