Submission #1679074
Source Code Expand
n,m = map(int,input().split()) st = [1<<30]*(n+1) wf = [[1<<30]*(n+1) for i in range(n+1)] for _ in range(m): u,v,l = map(int,input().split()) if u==1: st[v] = l else: wf[u][v] = wf[v][u] = l for k in range(n+1): for i in range(n+1): for j in range(n+1): if wf[i][j] > wf[i][k] + wf[k][j]: wf[i][j] = wf[i][k] + wf[k][j] ret = 1 << 30 for i in range(n+1): for j in range(n+1): if i==j: continue ret = min(st[i]+wf[i][j]+st[j],ret) print(ret if ret < 10**6 else -1)
Submission Info
Submission Time | |
---|---|
Task | C - Blue Bird |
User | omi |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 579 Byte |
Status | TLE |
Exec Time | 2104 ms |
Memory | 6524 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||
Status |
|
|
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 | 2060 ms | 4456 KB |
subtask1_02.txt | TLE | 2104 ms | 4696 KB |
subtask1_03.txt | TLE | 2104 ms | 5468 KB |
subtask1_04.txt | AC | 42 ms | 3064 KB |
subtask1_05.txt | AC | 920 ms | 3812 KB |
subtask1_06.txt | TLE | 2104 ms | 5360 KB |
subtask1_07.txt | AC | 555 ms | 3568 KB |
subtask1_08.txt | AC | 661 ms | 3436 KB |
subtask1_09.txt | TLE | 2104 ms | 5180 KB |
subtask1_10.txt | AC | 1855 ms | 4320 KB |
subtask1_11.txt | AC | 22 ms | 3064 KB |
subtask1_12.txt | TLE | 2104 ms | 5164 KB |
subtask1_13.txt | AC | 446 ms | 3440 KB |
subtask1_14.txt | AC | 286 ms | 3312 KB |
subtask1_15.txt | TLE | 2104 ms | 6524 KB |
subtask1_16.txt | TLE | 2104 ms | 6400 KB |
subtask1_17.txt | TLE | 2104 ms | 6284 KB |
subtask1_18.txt | TLE | 2104 ms | 6452 KB |
subtask1_19.txt | TLE | 2104 ms | 6512 KB |
subtask1_20.txt | TLE | 2104 ms | 6476 KB |
subtask1_21.txt | TLE | 2104 ms | 6408 KB |
subtask1_22.txt | TLE | 2104 ms | 6484 KB |
subtask1_23.txt | TLE | 2104 ms | 6432 KB |
subtask1_24.txt | TLE | 2104 ms | 6464 KB |
subtask1_25.txt | TLE | 2104 ms | 6432 KB |
subtask1_26.txt | TLE | 2104 ms | 5496 KB |
subtask1_27.txt | TLE | 2104 ms | 5772 KB |
subtask1_28.txt | TLE | 2104 ms | 6352 KB |
subtask1_29.txt | TLE | 2104 ms | 5504 KB |
subtask1_30.txt | TLE | 2104 ms | 3828 KB |