Submission #3391154

Source Code Expand

N,A,B = map(int,raw_input().split())

X = map(int,raw_input().split())
ans=0
for i in range(N-1):
    ans+=min([(X[i+1]-X[i])*A,B])

print ans

Submission Info

Submission Time
Task D - Walk and Teleport
User rikein12
Language Python (2.7.6)
Score 500
Code Size 149 Byte
Status AC
Exec Time 96 ms
Memory 11320 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 10 ms 2568 KB
sample_02.txt AC 10 ms 2568 KB
sample_03.txt AC 10 ms 2568 KB
subtask_1_balancedmax_01.txt AC 95 ms 11320 KB
subtask_1_balancedmax_02.txt AC 96 ms 11320 KB
subtask_1_max_01.txt AC 88 ms 11320 KB
subtask_1_max_02.txt AC 89 ms 11320 KB
subtask_1_min_01.txt AC 10 ms 2568 KB
subtask_1_onlya_01.txt AC 50 ms 7052 KB
subtask_1_onlyamax_01.txt AC 89 ms 11308 KB
subtask_1_onlyb_01.txt AC 29 ms 4628 KB
subtask_1_onlybmax_01.txt AC 88 ms 11308 KB
subtask_1_rand_01.txt AC 59 ms 8092 KB
subtask_1_rand_02.txt AC 75 ms 9816 KB
subtask_1_rand_03.txt AC 42 ms 5788 KB