Submission #1575902

Source Code Expand

n,a,b=[int(x) for x in input().split()]
ans=0
for i in range(n-1):
    ans+=max(a*(x[i+1]-x[i]),b)
print(ans)

Submission Info

Submission Time
Task D - Walk and Teleport
User lovemuffin
Language PyPy3 (2.4.0)
Score 0
Code Size 113 Byte
Status RE
Exec Time 164 ms
Memory 38384 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
RE × 3
RE × 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 RE 161 ms 38384 KB
sample_02.txt RE 161 ms 38256 KB
sample_03.txt RE 159 ms 38256 KB
subtask_1_balancedmax_01.txt RE 161 ms 38256 KB
subtask_1_balancedmax_02.txt RE 160 ms 38256 KB
subtask_1_max_01.txt RE 160 ms 38256 KB
subtask_1_max_02.txt RE 159 ms 38256 KB
subtask_1_min_01.txt RE 160 ms 38256 KB
subtask_1_onlya_01.txt RE 160 ms 38256 KB
subtask_1_onlyamax_01.txt RE 164 ms 38256 KB
subtask_1_onlyb_01.txt RE 161 ms 38256 KB
subtask_1_onlybmax_01.txt RE 159 ms 38256 KB
subtask_1_rand_01.txt RE 161 ms 38256 KB
subtask_1_rand_02.txt RE 160 ms 38256 KB
subtask_1_rand_03.txt RE 160 ms 38256 KB