Submission #1679759
Source Code Expand
import numpy as np def dijkstra(s): new_G = G.copy() cand = [i for i in range(N)] cand.remove(s) while len(cand) != 0: point = min(cand, key=lambda x:new_G[s, x]) cand.remove(point) for i in cand: if new_G[s, i] >= new_G[s, point] + new_G[point, i]: new_G[s, i] = new_G[s, point] + new_G[point, i] return np.max(new_G[s, :]) N, M = map(int, input().split(' ')) G = np.zeros([N, N], np.int32) G.fill(1000 * 300) for i in range(M): a, b, t = map(int, input().split(' ')) G[a - 1, b - 1] = t G[b - 1, a - 1] = t for i in range(N): G[i, i] = 0 worst_time = [] for p in range(N): worst_time.append(dijkstra(p)) print(min(worst_time))
Submission Info
Submission Time | |
---|---|
Task | D - バスと避けられない運命 |
User | macho_uno |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 751 Byte |
Status | TLE |
Exec Time | 5261 ms |
Memory | 20432 KB |
Judge Result
Set Name | All | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 100 | ||||
Status |
|
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 | 277 ms | 20432 KB |
sample_02.txt | AC | 148 ms | 12420 KB |
sample_03.txt | AC | 147 ms | 12420 KB |
test_01.txt | AC | 147 ms | 12420 KB |
test_02.txt | TLE | 5261 ms | 13172 KB |
test_03.txt | TLE | 5260 ms | 15124 KB |
test_04.txt | AC | 4765 ms | 14836 KB |
test_05.txt | AC | 4559 ms | 12660 KB |
test_06.txt | AC | 497 ms | 12420 KB |
test_07.txt | TLE | 5261 ms | 13016 KB |
test_08.txt | AC | 166 ms | 12420 KB |
test_09.txt | AC | 2929 ms | 14708 KB |
test_10.txt | AC | 456 ms | 12420 KB |
test_11.txt | AC | 554 ms | 12420 KB |
test_12.txt | TLE | 5260 ms | 14872 KB |
test_13.txt | AC | 546 ms | 12420 KB |
test_14.txt | AC | 752 ms | 12420 KB |
test_15.txt | TLE | 5261 ms | 12916 KB |
test_16.txt | AC | 829 ms | 12420 KB |
test_17.txt | AC | 3380 ms | 12660 KB |
test_18.txt | TLE | 5260 ms | 14888 KB |
test_19.txt | AC | 966 ms | 12420 KB |
test_20.txt | AC | 793 ms | 12420 KB |
test_21.txt | AC | 148 ms | 12420 KB |
test_22.txt | AC | 2236 ms | 12660 KB |
test_23.txt | AC | 155 ms | 12420 KB |
test_24.txt | TLE | 5261 ms | 13076 KB |
test_25.txt | TLE | 5260 ms | 15124 KB |
test_26.txt | AC | 3472 ms | 12660 KB |
test_27.txt | AC | 4344 ms | 14708 KB |
test_28.txt | TLE | 5261 ms | 13076 KB |
test_29.txt | TLE | 5261 ms | 13172 KB |
test_30.txt | AC | 693 ms | 12420 KB |
test_31.txt | AC | 184 ms | 12420 KB |
test_32.txt | TLE | 5260 ms | 15124 KB |
test_33.txt | TLE | 5260 ms | 15124 KB |
test_34.txt | AC | 334 ms | 12420 KB |
test_35.txt | AC | 2403 ms | 12660 KB |
test_36.txt | TLE | 5260 ms | 15124 KB |