Submission #1067549

Source Code Expand

a=gets.split.map(&:to_i)
b=gets.split.map(&:to_i)
c=[]
a[0].times{|i|
  next if i==0
  c << [(b[i]-b[i-1])*a[1],a[2]].min
}
p c.inject(:+)

Submission Info

Submission Time
Task D - Walk and Teleport
User masakt
Language Ruby (2.3.3)
Score 500
Code Size 145 Byte
Status AC
Exec Time 118 ms
Memory 11908 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 12
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 118 ms 11908 KB
subtask_1_balancedmax_02.txt AC 118 ms 11908 KB
subtask_1_max_01.txt AC 118 ms 11908 KB
subtask_1_max_02.txt AC 118 ms 11908 KB
subtask_1_min_01.txt AC 10 ms 1788 KB
subtask_1_onlya_01.txt AC 64 ms 7300 KB
subtask_1_onlyamax_01.txt AC 118 ms 11908 KB
subtask_1_onlyb_01.txt AC 35 ms 4604 KB
subtask_1_onlybmax_01.txt AC 118 ms 11908 KB
subtask_1_rand_01.txt AC 79 ms 10116 KB
subtask_1_rand_02.txt AC 100 ms 11268 KB
subtask_1_rand_03.txt AC 51 ms 6532 KB