Submission #1791300

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

int main(void){
    int N, M;
    cin >> N >> M;
    vector<vector<int> > e(N, vector<int>(N, 101010));
    
    for (int i = 0; i < M; i++) {
        int a,b,t;
        cin >> a >> b >> t;
        a--, b--;
        e[a][b] = t;
        e[b][a] = t;
    }
    
    for (int k = 0; k < N; k++) {
        for (int a = 0; a < N; a++) {
            for (int b = 0; b < N; b++) {
                e[a][b] = min(e[a][b], e[a][k] + e[k][b]);
                e[b][a] = e[a][b];
            }
        }
    }
    
    vector<int> ans(N, 0);
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            if (i == j) continue;
            ans[i] = max(ans[i], e[i][j]);
        }
    }
    
    cout << *min_element(ans.begin(), ans.end()) << endl;
}

Submission Info

Judge Result