Submission #11461845
Source Code Expand
N, A, B = map(int, input().split(" ")) X = list(map(int, input().split(" "))) ans = 0 for i in range(N - 1): ans += min(A * (X[i + 1] - X[i]), B) print(ans)
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | mits58 |
Language | PyPy3 (2.4.0) |
Score | 500 |
Code Size | 165 Byte |
Status | AC |
Exec Time | 243 ms |
Memory | 59732 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
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 | 180 ms | 38256 KB |
sample_02.txt | AC | 166 ms | 38256 KB |
sample_03.txt | AC | 165 ms | 38256 KB |
subtask_1_balancedmax_01.txt | AC | 243 ms | 59732 KB |
subtask_1_balancedmax_02.txt | AC | 241 ms | 58452 KB |
subtask_1_max_01.txt | AC | 230 ms | 58452 KB |
subtask_1_max_02.txt | AC | 221 ms | 58452 KB |
subtask_1_min_01.txt | AC | 174 ms | 38256 KB |
subtask_1_onlya_01.txt | AC | 201 ms | 45936 KB |
subtask_1_onlyamax_01.txt | AC | 221 ms | 58536 KB |
subtask_1_onlyb_01.txt | AC | 185 ms | 42096 KB |
subtask_1_onlybmax_01.txt | AC | 227 ms | 58536 KB |
subtask_1_rand_01.txt | AC | 205 ms | 49256 KB |
subtask_1_rand_02.txt | AC | 221 ms | 52820 KB |
subtask_1_rand_03.txt | AC | 192 ms | 43888 KB |