Submission #1245893


Source Code Expand

import sys

inf = 1<<30

def solve():
    n, m = map(int, sys.stdin.readline().split())
    cost = [[inf]*n for i in range(n)]

    for u in range(n):
        cost[u][u] = 0

    for i in range(m):
        u, v, l = map(int, sys.stdin.readline().split())
        u, v = u - 1, v - 1
        cost[u][v] = l
        cost[v][u] = l

    dist = [[inf]*n for i in range(n)]

    for u in range(1, n):
        for v in range(1, n):
            dist[u][v] = cost[u][v]
            dist[v][u] = dist[u][v]

    for k in range(1, n):
        for i in range(1, n):
            for j in range(1, n):
                dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j])
                dist[j][i] = dist[i][j]

    ans = inf

    for u in range(1, n):
        for v in range(u + 1, n):
            ans = min(ans, cost[0][u] + dist[u][v] + cost[v][0])

    if ans == inf:
        print(-1)
    else:
        print(ans)


if __name__ == '__main__':
    solve()

Submission Info

Submission Time
Task C - Blue Bird
User nanae
Language Python (3.4.3)
Score 0
Code Size 990 Byte
Status TLE
Exec Time 2104 ms
Memory 7108 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 3
AC × 10
TLE × 23
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt
Case Name Status Exec Time Memory
sample_01.txt AC 17 ms 3064 KB
sample_02.txt AC 17 ms 3064 KB
sample_03.txt AC 18 ms 3064 KB
subtask1_01.txt TLE 2104 ms 4468 KB
subtask1_02.txt TLE 2104 ms 4440 KB
subtask1_03.txt TLE 2104 ms 5792 KB
subtask1_04.txt AC 45 ms 3064 KB
subtask1_05.txt AC 1724 ms 3828 KB
subtask1_06.txt TLE 2104 ms 5732 KB
subtask1_07.txt AC 767 ms 3444 KB
subtask1_08.txt AC 985 ms 3444 KB
subtask1_09.txt TLE 2104 ms 5644 KB
subtask1_10.txt TLE 2104 ms 4340 KB
subtask1_11.txt AC 21 ms 3064 KB
subtask1_12.txt TLE 2104 ms 4800 KB
subtask1_13.txt AC 639 ms 3504 KB
subtask1_14.txt AC 461 ms 3316 KB
subtask1_15.txt TLE 2104 ms 7108 KB
subtask1_16.txt TLE 2104 ms 6364 KB
subtask1_17.txt TLE 2104 ms 5444 KB
subtask1_18.txt TLE 2104 ms 6516 KB
subtask1_19.txt TLE 2104 ms 6452 KB
subtask1_20.txt TLE 2104 ms 5996 KB
subtask1_21.txt TLE 2104 ms 6032 KB
subtask1_22.txt TLE 2104 ms 6960 KB
subtask1_23.txt TLE 2104 ms 7092 KB
subtask1_24.txt TLE 2104 ms 5936 KB
subtask1_25.txt TLE 2104 ms 6228 KB
subtask1_26.txt TLE 2104 ms 5852 KB
subtask1_27.txt TLE 2104 ms 5832 KB
subtask1_28.txt TLE 2104 ms 5816 KB
subtask1_29.txt TLE 2104 ms 5864 KB
subtask1_30.txt TLE 2104 ms 4468 KB