Submission #1067920


Source Code Expand

def reads():
  return [int(x) for x in input().split()]

(N, A, B) = reads()
X = reads()

result = 0
for i in range(1, N):
  result += min(A*(X[i] - X[i-1]), B)
print(result)

Submission Info

Submission Time
Task D - Walk and Teleport
User ukikagi
Language Python (3.4.3)
Score 500
Code Size 183 Byte
Status AC
Exec Time 111 ms
Memory 14480 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 12
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All 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 22 ms 3064 KB
sample_02.txt AC 22 ms 3064 KB
sample_03.txt AC 22 ms 3064 KB
subtask_1_balancedmax_01.txt AC 107 ms 14480 KB
subtask_1_balancedmax_02.txt AC 108 ms 14480 KB
subtask_1_max_01.txt AC 111 ms 14480 KB
subtask_1_max_02.txt AC 109 ms 14480 KB
subtask_1_min_01.txt AC 22 ms 3064 KB
subtask_1_onlya_01.txt AC 64 ms 8716 KB
subtask_1_onlyamax_01.txt AC 109 ms 14052 KB
subtask_1_onlyb_01.txt AC 42 ms 5680 KB
subtask_1_onlybmax_01.txt AC 106 ms 14052 KB
subtask_1_rand_01.txt AC 74 ms 10040 KB
subtask_1_rand_02.txt AC 92 ms 12660 KB
subtask_1_rand_03.txt AC 53 ms 7108 KB