Submission #3775959

Source Code Expand

a,b,c = map(int,input().split(" "))
ar = list(map(int,input().split(" ")))
count = 0
for i in range(a-1):
    if (ar[i+1] - ar[i]) * b <= c:
        count += (ar[i+1] - ar[i]) * b
    else:
        count += c
print(count)

Submission Info

Submission Time
Task D - Walk and Teleport
User beetiruka
Language Python (3.4.3)
Score 500
Code Size 231 Byte
Status AC
Exec Time 94 ms
Memory 14224 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 90 ms 14224 KB
subtask_1_balancedmax_02.txt AC 91 ms 14224 KB
subtask_1_max_01.txt AC 76 ms 14224 KB
subtask_1_max_02.txt AC 76 ms 14224 KB
subtask_1_min_01.txt AC 17 ms 2940 KB
subtask_1_onlya_01.txt AC 56 ms 8588 KB
subtask_1_onlyamax_01.txt AC 94 ms 14052 KB
subtask_1_onlyb_01.txt AC 32 ms 5680 KB
subtask_1_onlybmax_01.txt AC 76 ms 14060 KB
subtask_1_rand_01.txt AC 54 ms 9912 KB
subtask_1_rand_02.txt AC 66 ms 12660 KB
subtask_1_rand_03.txt AC 39 ms 7104 KB