Submission #3780389
Source Code Expand
N, M = gets.split.map(&:to_i) es = [] edges = Array.new(N){[]} M.times do |i| a, b, c = gets.split.map(&:to_i) es.push([a-1, b-1, c]) edges[a-1].push([b-1, c, i]) edges[b-1].push([a-1, c, i]) end INF = 10**8 dist = Array.new(N, INF) used = [] prev = [] dist[0] = 0 loop do v = -1 N.times do |u| if !used[u] && (v == -1 || dist[u] < dist[v]) v = u end end break if v == -1 used[v] = true edges[v].each do |u, c, e| if dist[u] > dist[v] + c dist[u] = dist[v] + c prev[u] = e end end end tree = [] (1...N).each do |i| tree[prev[i]] = true end ans = INF M.times do |e| next if tree[e] result = dist[es[e][0]] + dist[es[e][1]] + es[e][2] ans = result if ans > result end puts ans==INF ? -1 : ans
Submission Info
Submission Time | |
---|---|
Task | C - Blue Bird |
User | betrue12 |
Language | Ruby (2.3.3) |
Score | 0 |
Code Size | 866 Byte |
Status | RE |
Exec Time | 141 ms |
Memory | 12540 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 | 7 ms | 1788 KB |
sample_02.txt | AC | 7 ms | 1788 KB |
sample_03.txt | AC | 7 ms | 1788 KB |
subtask1_01.txt | WA | 39 ms | 3964 KB |
subtask1_02.txt | AC | 27 ms | 2940 KB |
subtask1_03.txt | AC | 80 ms | 8056 KB |
subtask1_04.txt | WA | 8 ms | 1788 KB |
subtask1_05.txt | AC | 25 ms | 3068 KB |
subtask1_06.txt | WA | 85 ms | 8316 KB |
subtask1_07.txt | AC | 13 ms | 2172 KB |
subtask1_08.txt | RE | 9 ms | 1788 KB |
subtask1_09.txt | AC | 83 ms | 8316 KB |
subtask1_10.txt | WA | 44 ms | 4476 KB |
subtask1_11.txt | WA | 7 ms | 1788 KB |
subtask1_12.txt | AC | 21 ms | 2428 KB |
subtask1_13.txt | WA | 22 ms | 2940 KB |
subtask1_14.txt | AC | 10 ms | 1788 KB |
subtask1_15.txt | WA | 134 ms | 11388 KB |
subtask1_16.txt | AC | 62 ms | 6012 KB |
subtask1_17.txt | WA | 22 ms | 2172 KB |
subtask1_18.txt | WA | 79 ms | 7292 KB |
subtask1_19.txt | WA | 77 ms | 7036 KB |
subtask1_20.txt | AC | 37 ms | 3836 KB |
subtask1_21.txt | AC | 40 ms | 3964 KB |
subtask1_22.txt | AC | 127 ms | 10364 KB |
subtask1_23.txt | AC | 141 ms | 12540 KB |
subtask1_24.txt | WA | 36 ms | 3580 KB |
subtask1_25.txt | WA | 64 ms | 6140 KB |
subtask1_26.txt | AC | 105 ms | 10108 KB |
subtask1_27.txt | AC | 85 ms | 8060 KB |
subtask1_28.txt | AC | 28 ms | 2812 KB |
subtask1_29.txt | AC | 105 ms | 10108 KB |
subtask1_30.txt | AC | 16 ms | 1788 KB |