Submission #1791856
Source Code Expand
n,a,b=gets.split n=n.to_i a=a.to_i b=b.to_i array=gets.split.map(&:to_i) i=0 answer=0 (n-1).times{ answer+=[(array[i+1]-array[i])*a,b].min i+=1 } puts answer
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | hamasugar |
Language | Ruby (2.3.3) |
Score | 500 |
Code Size | 191 Byte |
Status | AC |
Exec Time | 93 ms |
Memory | 11012 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 | sample_01.txt, sample_02.txt, sample_03.txt, 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 | 7 ms | 1788 KB |
sample_02.txt | AC | 7 ms | 1788 KB |
sample_03.txt | AC | 7 ms | 1788 KB |
subtask_1_balancedmax_01.txt | AC | 93 ms | 11012 KB |
subtask_1_balancedmax_02.txt | AC | 91 ms | 11012 KB |
subtask_1_max_01.txt | AC | 91 ms | 11012 KB |
subtask_1_max_02.txt | AC | 91 ms | 11012 KB |
subtask_1_min_01.txt | AC | 7 ms | 1788 KB |
subtask_1_onlya_01.txt | AC | 52 ms | 6788 KB |
subtask_1_onlyamax_01.txt | AC | 91 ms | 11012 KB |
subtask_1_onlyb_01.txt | AC | 28 ms | 4220 KB |
subtask_1_onlybmax_01.txt | AC | 91 ms | 11012 KB |
subtask_1_rand_01.txt | AC | 62 ms | 9476 KB |
subtask_1_rand_02.txt | AC | 78 ms | 10500 KB |
subtask_1_rand_03.txt | AC | 41 ms | 6276 KB |