Submission #202019

---

Source Code Expand

#include<iostream>
#include<algorithm>
using namespace std;
const int BUF = 305;
const int INF = 1<<28;

int N, adj[BUF][BUF];

void read() {
    int E;
    cin >> N >> E;

    for (int i = 0; i < BUF; ++i)
        for (int j = 0; j < BUF; ++j)
            adj[i][j] = INF;

    for (int i = 0; i < E; ++i) {
        int s, t, c;
        cin >> s >> t >> c;
        adj[s - 1][t - 1] = adj[t - 1][s - 1] = c;
    }
}


void work() {
    for (int i = 0; i < N; ++i)
        adj[i][i] = 0;

    for (int k = 0; k < N; ++k)
        for (int i = 0; i < N; ++i)
            for (int j = 0; j < N; ++j)
                adj[i][j] = min(adj[i][j], adj[i][k] + adj[k][j]);

    int minV = INF;
    for (int i = 0; i < N; ++i)
        minV = min(minV, *max_element(adj[i], adj[i] + N));

    cout << minV << endl;
}

int main() {
    read();
    work();
    return 0;
}

Submission Info

Judge Result