Submission #1589696


Source Code Expand

#include <iostream>
#include <queue>
#include <vector>
#include <cmath>
#include <algorithm>
#include <map>
#include <numeric>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>


using namespace std;
using ll = long long;
const ll INF = 1e9;

int N, M;
int d[300][300];

void warshall_floyd() { // N: length of vertices
    for (int k = 0; k < N; k++)
        for (int i = 0; i < N; i++)
            for (int j = 0; j < N; j++) d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}


int main() {
    cin >> N >> M;
    for (int i = 0; i < N; i++) for (int q = 0; q < N; q++) d[i][q] = (i == q ? 0 : 99999999);
    for (int i = 0; i < M; i++) {
        int a, b, c;
        cin >> a >> b >> c; a--; b--;
        d[a][b] = c;
        d[b][a] = c;
    }

    warshall_floyd();

    int ans = 99999999;
    for (int i = 0; i < N; i++) {
        int mx = 0;
        for (int q = 0; q < N; q++) {
            mx = max(mx, d[i][q]);
        }
        ans = min(ans, mx);
    }

    cout << ans << endl;

    return 0;
}

Submission Info

Submission Time
Task D - バスと避けられない運命
User sei0o
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1075 Byte
Status AC
Exec Time 65 ms
Memory 640 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 39
Set Name Test Cases
All sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
test_01.txt AC 1 ms 256 KB
test_02.txt AC 32 ms 640 KB
test_03.txt AC 65 ms 640 KB
test_04.txt AC 13 ms 512 KB
test_05.txt AC 24 ms 512 KB
test_06.txt AC 5 ms 384 KB
test_07.txt AC 50 ms 512 KB
test_08.txt AC 2 ms 256 KB
test_09.txt AC 18 ms 384 KB
test_10.txt AC 4 ms 384 KB
test_11.txt AC 4 ms 384 KB
test_12.txt AC 20 ms 512 KB
test_13.txt AC 5 ms 384 KB
test_14.txt AC 6 ms 384 KB
test_15.txt AC 46 ms 512 KB
test_16.txt AC 7 ms 384 KB
test_17.txt AC 20 ms 512 KB
test_18.txt AC 19 ms 512 KB
test_19.txt AC 7 ms 384 KB
test_20.txt AC 6 ms 384 KB
test_21.txt AC 1 ms 256 KB
test_22.txt AC 9 ms 384 KB
test_23.txt AC 1 ms 256 KB
test_24.txt AC 32 ms 640 KB
test_25.txt AC 32 ms 640 KB
test_26.txt AC 8 ms 512 KB
test_27.txt AC 10 ms 512 KB
test_28.txt AC 32 ms 640 KB
test_29.txt AC 32 ms 640 KB
test_30.txt AC 3 ms 384 KB
test_31.txt AC 1 ms 256 KB
test_32.txt AC 32 ms 640 KB
test_33.txt AC 32 ms 640 KB
test_34.txt AC 2 ms 384 KB
test_35.txt AC 6 ms 384 KB
test_36.txt AC 32 ms 640 KB