Submission #11461867

Source Code Expand

N, A, B = map(int, input().split(" "))
X = list(map(int, input().split(" ")))
print(sum([min(A * (X[i + 1] - X[i]), B) for i in range(N - 1)]))

Submission Info

Submission Time
Task D - Walk and Teleport
User mits58
Language PyPy3 (2.4.0)
Score 500
Code Size 145 Byte
Status AC
Exec Time 220 ms
Memory 63700 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 159 ms 38256 KB
sample_02.txt AC 159 ms 38256 KB
sample_03.txt AC 162 ms 38384 KB
subtask_1_balancedmax_01.txt AC 220 ms 63700 KB
subtask_1_balancedmax_02.txt AC 216 ms 63572 KB
subtask_1_max_01.txt AC 217 ms 62932 KB
subtask_1_max_02.txt AC 216 ms 62932 KB
subtask_1_min_01.txt AC 160 ms 38256 KB
subtask_1_onlya_01.txt AC 192 ms 47452 KB
subtask_1_onlyamax_01.txt AC 214 ms 63656 KB
subtask_1_onlyb_01.txt AC 177 ms 42096 KB
subtask_1_onlybmax_01.txt AC 215 ms 63656 KB
subtask_1_rand_01.txt AC 197 ms 51304 KB
subtask_1_rand_02.txt AC 205 ms 55764 KB
subtask_1_rand_03.txt AC 179 ms 43888 KB