Submission #1517343
Source Code Expand
n, m = gets.split.map(&:to_i) cost = Array.new(n+1){Array.new(n+1){Float::INFINITY}} m.times{ u, v, l = gets.split.map(&:to_i) cost[u][v] = cost[v][u] = l } (2..n).each{|k| (2..n).each{|i| (2..n).each{|j| cost[i][j] = [cost[i][j], cost[i][k]+cost[k][j]].min } } } res = (2..n).select{|i| cost[1][i] != Float::INFINITY}.combination(2).map{|i, j| cost[1][i] + cost[i][j] + cost[j][1]}.min p res!=Float::INFINITY ? res : -1
Submission Info
Submission Time | |
---|---|
Task | C - Blue Bird |
User | refle |
Language | Ruby (2.3.3) |
Score | 0 |
Code Size | 458 Byte |
Status | WA |
Exec Time | 2108 ms |
Memory | 2812 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 | 8 ms | 1788 KB |
subtask1_01.txt | TLE | 2107 ms | 2300 KB |
subtask1_02.txt | TLE | 2107 ms | 2428 KB |
subtask1_03.txt | TLE | 2108 ms | 2556 KB |
subtask1_04.txt | AC | 37 ms | 1788 KB |
subtask1_05.txt | AC | 1457 ms | 2044 KB |
subtask1_06.txt | TLE | 2107 ms | 2556 KB |
subtask1_07.txt | AC | 781 ms | 1916 KB |
subtask1_08.txt | AC | 1157 ms | 1916 KB |
subtask1_09.txt | TLE | 2107 ms | 2556 KB |
subtask1_10.txt | TLE | 2107 ms | 2044 KB |
subtask1_11.txt | WA | 12 ms | 1788 KB |
subtask1_12.txt | TLE | 2107 ms | 2556 KB |
subtask1_13.txt | AC | 649 ms | 1916 KB |
subtask1_14.txt | AC | 480 ms | 1916 KB |
subtask1_15.txt | TLE | 2107 ms | 2812 KB |
subtask1_16.txt | TLE | 2107 ms | 2812 KB |
subtask1_17.txt | TLE | 2107 ms | 2812 KB |
subtask1_18.txt | TLE | 2107 ms | 2812 KB |
subtask1_19.txt | TLE | 2107 ms | 2812 KB |
subtask1_20.txt | TLE | 2107 ms | 2812 KB |
subtask1_21.txt | TLE | 2107 ms | 2812 KB |
subtask1_22.txt | TLE | 2108 ms | 2812 KB |
subtask1_23.txt | TLE | 2107 ms | 2812 KB |
subtask1_24.txt | TLE | 2108 ms | 2812 KB |
subtask1_25.txt | TLE | 2107 ms | 2812 KB |
subtask1_26.txt | TLE | 2108 ms | 2812 KB |
subtask1_27.txt | TLE | 2107 ms | 2812 KB |
subtask1_28.txt | TLE | 2107 ms | 2812 KB |
subtask1_29.txt | TLE | 2108 ms | 2812 KB |
subtask1_30.txt | TLE | 2107 ms | 2556 KB |