AtCoder Beginner Contest 012

Submission #3979783

Source codeソースコード

def warshall_floyd(v_count: int, matrix: list) -> list:
    """ ワーシャルフロイド
    :param v_count: 頂点数
    :param matrix: 隣接行列(到達不能はfloat("inf"))
    """
    # 到達不能をfloat("inf")にしておけば余計なチェックを入れなくても
    # inf > inf+(-1) のような到達不能+負辺が繋がってしまうことはない
    for i in range(v_count):
        for j, c2 in enumerate(row[i] for row in matrix):
            for k, (c1, c3) in enumerate(zip(matrix[j], matrix[i])):
                if c1 > c2+c3:
                    matrix[j][k] = c2+c3
    return matrix


if __name__ == "__main__":
    import sys
    N, M = map(int, input().split())

    inf = float("inf")
    matrix = [[inf]*N for _ in [0]*N]
    for i in range(N):
        matrix[i][i] = 0

    for a, b, t in (map(int, l.split()) for l in sys.stdin):
        matrix[a-1][b-1] = matrix[b-1][a-1] = t

    matrix = warshall_floyd(N, matrix)

    print(min(max(row) for row in matrix))

Submission

Task問題 D - バスと避けられない運命
User nameユーザ名 odanny
Created time投稿日時
Language言語 Python3 (3.4.3)
Status状態 AC
Score得点 100
Source lengthソースコード長 1040 Byte
File nameファイル名
Exec time実行時間 2991 ms
Memory usageメモリ使用量 6564 KB

Test case

Set

Set name Score得点 / Max score Cases
All 100 / 100 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
sample_01.txt AC 18 ms 3064 KB
sample_02.txt AC 18 ms 3064 KB
sample_03.txt AC 18 ms 3064 KB
test_01.txt AC 18 ms 3064 KB
test_02.txt AC 2991 ms 6500 KB
test_03.txt AC 2640 ms 5172 KB
test_04.txt AC 1011 ms 4656 KB
test_05.txt AC 788 ms 3940 KB
test_06.txt AC 88 ms 3188 KB
test_07.txt AC 1884 ms 4800 KB
test_08.txt AC 22 ms 3064 KB
test_09.txt AC 532 ms 3680 KB
test_10.txt AC 76 ms 3188 KB
test_11.txt AC 87 ms 3188 KB
test_12.txt AC 1451 ms 5032 KB
test_13.txt AC 92 ms 3188 KB
test_14.txt AC 131 ms 3188 KB
test_15.txt AC 1712 ms 4680 KB
test_16.txt AC 149 ms 3316 KB
test_17.txt AC 601 ms 3800 KB
test_18.txt AC 1288 ms 4892 KB
test_19.txt AC 162 ms 3316 KB
test_20.txt AC 140 ms 3316 KB
test_21.txt AC 19 ms 3064 KB
test_22.txt AC 440 ms 3784 KB
test_23.txt AC 20 ms 3064 KB
test_24.txt AC 2861 ms 6508 KB
test_25.txt AC 2886 ms 6540 KB
test_26.txt AC 632 ms 4312 KB
test_27.txt AC 835 ms 4528 KB
test_28.txt AC 2860 ms 6552 KB
test_29.txt AC 2851 ms 6564 KB
test_30.txt AC 138 ms 3432 KB
test_31.txt AC 27 ms 3064 KB
test_32.txt AC 2899 ms 6564 KB
test_33.txt AC 2861 ms 6528 KB
test_34.txt AC 58 ms 3188 KB
test_35.txt AC 498 ms 4072 KB
test_36.txt AC 2875 ms 6560 KB