Submission #1067343
Source Code Expand
n, a, b = gets.chomp.split.map(&:to_i) towns = gets.chomp.split.map(&:to_i) distances = [] pos, total = 0, 0 (n-1).times do |i| distances[i] = towns[i+1] - towns[i] end (n-1).times do |i| if a * distances[pos] < b total += a * distances[pos] pos += 1 else total += b pos += 1 end end puts total
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | hanocha |
Language | Ruby (2.3.3) |
Score | 500 |
Code Size | 340 Byte |
Status | AC |
Exec Time | 89 ms |
Memory | 10324 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | subtask_1_balancedmax_01.txt, subtask_1_balancedmax_02.txt, subtask_1_max_01.txt, subtask_1_max_02.txt, subtask_1_min_01.txt, subtask_1_onlya_01.txt, subtask_1_onlyamax_01.txt, subtask_1_onlyb_01.txt, subtask_1_onlybmax_01.txt, subtask_1_rand_01.txt, subtask_1_rand_02.txt, subtask_1_rand_03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 10 ms | 1788 KB |
sample_02.txt | AC | 10 ms | 1788 KB |
sample_03.txt | AC | 10 ms | 1788 KB |
subtask_1_balancedmax_01.txt | AC | 88 ms | 10324 KB |
subtask_1_balancedmax_02.txt | AC | 89 ms | 10324 KB |
subtask_1_max_01.txt | AC | 85 ms | 10324 KB |
subtask_1_max_02.txt | AC | 85 ms | 10324 KB |
subtask_1_min_01.txt | AC | 11 ms | 1788 KB |
subtask_1_onlya_01.txt | AC | 50 ms | 6284 KB |
subtask_1_onlyamax_01.txt | AC | 89 ms | 10324 KB |
subtask_1_onlyb_01.txt | AC | 27 ms | 3836 KB |
subtask_1_onlybmax_01.txt | AC | 88 ms | 10324 KB |
subtask_1_rand_01.txt | AC | 56 ms | 7256 KB |
subtask_1_rand_02.txt | AC | 71 ms | 8972 KB |
subtask_1_rand_03.txt | AC | 36 ms | 4820 KB |