Submission #628742

---

Source Code Expand

#include <cstdio>
#include <algorithm>
using namespace std;

#define REP(i,n) for(int i = 0; i < (int)(n); ++i)

const int INF = 10000000;
const int MAX_V = 300;
int graph[MAX_V][MAX_V];
int N, M;

bool visited[MAX_V];
int cost[MAX_V];

void init_graph() {
    REP(i, N) {
        REP(j, N) {
            if (i == j) graph[i][j] = 0;
            else        graph[i][j] = INF;
        }
    }
}

void make() {
    REP(i, M) {
        int u, v, c;
        scanf("%d %d %d", &u, &v, &c);
        u--; v--;
        graph[u][v] = c; graph[v][u] = c;
    }
}

void init_dijkstra() {
    REP(i, N) visited[i] = false;
    REP(i, N) cost[i] = INF;
}

void dijkstra(int start) {
    init_dijkstra();

    cost[start] = 0;

    while (true) {
        int mi = INF;
        int nxt = -1;
        visited[start] = true;
        REP(i, N) {
            if (visited[i]) continue;
            if (i != start) {
                int d = cost[start] + graph[start][i];
                if (d < cost[i]) {
                    cost[i] = d;
                }
            }
            if (mi > cost[i]) {
                mi = cost[i];
                nxt = i;
            }
        }
        start = nxt;
        if (nxt == -1) break;
    }
}

void solve() {
    scanf("%d %d", &N, &M);

    init_graph();

    make();

    int mi = INF;
    REP(i, N) {
        dijkstra(i);
        int ma = 0;
        REP(j, N) {
            if (ma < cost[j])
                ma = cost[j];
        }
        mi = min(mi, ma);
    }

    printf("%d", mi);
}

int main() {
    solve();
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘void solve()’:
./Main.cpp:66:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp: In function ‘void make()’:
./Main.cpp:27:38: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result