Submission #1575908

Source Code Expand

n,a,b=[int(x) for x in input().split()]
x=[int(x) for x in input().split()]
ans=0
for i in range(n-1):
    ans+=min(a*(x[i+1]-x[i]),b)
print(ans)

Submission Info

Submission Time
Task D - Walk and Teleport
User lovemuffin
Language PyPy3 (2.4.0)
Score 500
Code Size 150 Byte
Status AC
Exec Time 259 ms
Memory 63984 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 15
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 166 ms 38256 KB
sample_02.txt AC 175 ms 38256 KB
sample_03.txt AC 164 ms 38256 KB
subtask_1_balancedmax_01.txt AC 259 ms 63984 KB
subtask_1_balancedmax_02.txt AC 229 ms 62576 KB
subtask_1_max_01.txt AC 220 ms 62576 KB
subtask_1_max_02.txt AC 222 ms 62576 KB
subtask_1_min_01.txt AC 166 ms 38256 KB
subtask_1_onlya_01.txt AC 197 ms 48496 KB
subtask_1_onlyamax_01.txt AC 220 ms 62704 KB
subtask_1_onlyb_01.txt AC 182 ms 42608 KB
subtask_1_onlybmax_01.txt AC 221 ms 62704 KB
subtask_1_rand_01.txt AC 213 ms 49640 KB
subtask_1_rand_02.txt AC 212 ms 53588 KB
subtask_1_rand_03.txt AC 192 ms 45424 KB