Submission #2382563


Source Code Expand

n,a,b = map(int, input().split(" "))
x = input().split(" ")
sum = 0
for i in range(n):
    x[i] = int(x[i])
for i in range(n-1):
    if a*(x[i+1]-x[i]) > b:
        sum += b
    else:
        sum += a*(x[i+1]-x[i])
print(sum)

Submission Info

Submission Time
Task D - Walk and Teleport
User vjudge3
Language Python (3.4.3)
Score 500
Code Size 225 Byte
Status AC
Exec Time 116 ms
Memory 11096 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 3060 KB
sample_02.txt AC 17 ms 2940 KB
sample_03.txt AC 17 ms 3060 KB
subtask_1_balancedmax_01.txt AC 99 ms 11052 KB
subtask_1_balancedmax_02.txt AC 101 ms 11052 KB
subtask_1_max_01.txt AC 89 ms 11096 KB
subtask_1_max_02.txt AC 90 ms 11096 KB
subtask_1_min_01.txt AC 17 ms 3060 KB
subtask_1_onlya_01.txt AC 62 ms 7044 KB
subtask_1_onlyamax_01.txt AC 116 ms 11064 KB
subtask_1_onlyb_01.txt AC 34 ms 4892 KB
subtask_1_onlybmax_01.txt AC 89 ms 11064 KB
subtask_1_rand_01.txt AC 64 ms 8092 KB
subtask_1_rand_02.txt AC 78 ms 9756 KB
subtask_1_rand_03.txt AC 43 ms 5924 KB