Submission #11461925

Source Code Expand

N,A,B,*X=map(int,open(0).read().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 Python (3.4.3)
Score 500
Code Size 94 Byte
Status AC
Exec Time 76 ms
Memory 14052 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 17 ms 2940 KB
sample_02.txt AC 17 ms 2940 KB
sample_03.txt AC 17 ms 2940 KB
subtask_1_balancedmax_01.txt AC 76 ms 14052 KB
subtask_1_balancedmax_02.txt AC 76 ms 14052 KB
subtask_1_max_01.txt AC 74 ms 14052 KB
subtask_1_max_02.txt AC 75 ms 14052 KB
subtask_1_min_01.txt AC 17 ms 2940 KB
subtask_1_onlya_01.txt AC 49 ms 8588 KB
subtask_1_onlyamax_01.txt AC 74 ms 14028 KB
subtask_1_onlyb_01.txt AC 32 ms 5660 KB
subtask_1_onlybmax_01.txt AC 75 ms 14028 KB
subtask_1_rand_01.txt AC 55 ms 9900 KB
subtask_1_rand_02.txt AC 65 ms 12196 KB
subtask_1_rand_03.txt AC 38 ms 7084 KB