Submission #1679075
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 | PyPy3 (2.4.0) |
Score | 0 |
Code Size | 580 Byte |
Status | WA |
Exec Time | 826 ms |
Memory | 48088 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 | 178 ms | 38384 KB |
sample_02.txt | AC | 179 ms | 38256 KB |
sample_03.txt | AC | 186 ms | 38768 KB |
subtask1_01.txt | AC | 424 ms | 48088 KB |
subtask1_02.txt | AC | 456 ms | 47704 KB |
subtask1_03.txt | AC | 631 ms | 47064 KB |
subtask1_04.txt | AC | 215 ms | 40688 KB |
subtask1_05.txt | AC | 338 ms | 45784 KB |
subtask1_06.txt | AC | 563 ms | 47192 KB |
subtask1_07.txt | AC | 295 ms | 45672 KB |
subtask1_08.txt | AC | 231 ms | 41308 KB |
subtask1_09.txt | AC | 555 ms | 47320 KB |
subtask1_10.txt | AC | 418 ms | 45912 KB |
subtask1_11.txt | AC | 211 ms | 39152 KB |
subtask1_12.txt | AC | 444 ms | 47192 KB |
subtask1_13.txt | AC | 296 ms | 45656 KB |
subtask1_14.txt | AC | 220 ms | 40940 KB |
subtask1_15.txt | AC | 763 ms | 47576 KB |
subtask1_16.txt | AC | 677 ms | 47192 KB |
subtask1_17.txt | AC | 672 ms | 47576 KB |
subtask1_18.txt | AC | 763 ms | 47320 KB |
subtask1_19.txt | AC | 732 ms | 47192 KB |
subtask1_20.txt | AC | 669 ms | 47448 KB |
subtask1_21.txt | AC | 666 ms | 47192 KB |
subtask1_22.txt | AC | 775 ms | 47832 KB |
subtask1_23.txt | AC | 826 ms | 47576 KB |
subtask1_24.txt | AC | 703 ms | 47192 KB |
subtask1_25.txt | AC | 736 ms | 47576 KB |
subtask1_26.txt | AC | 718 ms | 47832 KB |
subtask1_27.txt | AC | 691 ms | 47448 KB |
subtask1_28.txt | AC | 630 ms | 47448 KB |
subtask1_29.txt | AC | 809 ms | 47832 KB |
subtask1_30.txt | WA | 565 ms | 42332 KB |