Submission #30084536
Source Code Expand
(N,M),*ABC = $<.map{|ln| ln.split.map(&:to_i) }
D = Array.new(N){[nil]*N}
ABC.map!{|a,b,c| [a-1,b-1,c] }.each{|a,b,c|
D[a][b] = D[b][a] = c
}
U = Array.new(N){[nil]*N}
D.each_with_index{|m2,m|
m2.each_with_index{|m2a,a|
m2[a+1,N].each.with_index(a+1){|m2b,b|
U[a][b] = D[a][b] = D[b][a] = m2a+m2b if m2b && ! D[a][b]&.<(m2a+m2b)
} if m2a
}
}
p ABC.count{|a,b,| U[a][b] }
Submission Info
| Submission Time | |
|---|---|
| Task | E - Edge Deletion |
| User | ds14050 |
| Language | Ruby (2.7.1) |
| Score | 500 |
| Code Size | 397 Byte |
| Status | AC |
| Exec Time | 1281 ms |
| Memory | 23616 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 500 / 500 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt |
| All | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_small_00.txt, 01_small_01.txt, 01_small_02.txt, 01_small_03.txt, 01_small_04.txt, 01_small_05.txt, 02_perfect_00.txt, 02_perfect_01.txt, 02_perfect_02.txt, 02_perfect_03.txt, 02_perfect_04.txt, 02_perfect_05.txt, 03_anti-dijkstra_00.txt, 03_anti-dijkstra_01.txt, 03_anti-dijkstra_02.txt, 03_anti-dijkstra_03.txt, 04_random_00.txt, 04_random_01.txt, 05_tree_00.txt, 05_tree_01.txt, 06_path_00.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| 00_sample_00.txt | AC | 56 ms | 14172 KiB |
| 00_sample_01.txt | AC | 53 ms | 14268 KiB |
| 00_sample_02.txt | AC | 53 ms | 14244 KiB |
| 01_small_00.txt | AC | 66 ms | 14100 KiB |
| 01_small_01.txt | AC | 62 ms | 14244 KiB |
| 01_small_02.txt | AC | 64 ms | 14372 KiB |
| 01_small_03.txt | AC | 61 ms | 14108 KiB |
| 01_small_04.txt | AC | 62 ms | 14200 KiB |
| 01_small_05.txt | AC | 62 ms | 14108 KiB |
| 02_perfect_00.txt | AC | 1242 ms | 23208 KiB |
| 02_perfect_01.txt | AC | 1235 ms | 23296 KiB |
| 02_perfect_02.txt | AC | 1281 ms | 23320 KiB |
| 02_perfect_03.txt | AC | 1235 ms | 23484 KiB |
| 02_perfect_04.txt | AC | 1240 ms | 23548 KiB |
| 02_perfect_05.txt | AC | 1255 ms | 23492 KiB |
| 03_anti-dijkstra_00.txt | AC | 1174 ms | 23196 KiB |
| 03_anti-dijkstra_01.txt | AC | 1257 ms | 23548 KiB |
| 03_anti-dijkstra_02.txt | AC | 1190 ms | 23616 KiB |
| 03_anti-dijkstra_03.txt | AC | 1213 ms | 23400 KiB |
| 04_random_00.txt | AC | 1192 ms | 19628 KiB |
| 04_random_01.txt | AC | 1197 ms | 19780 KiB |
| 05_tree_00.txt | AC | 142 ms | 15960 KiB |
| 05_tree_01.txt | AC | 118 ms | 15928 KiB |
| 06_path_00.txt | AC | 98 ms | 16064 KiB |