Submission #1987136
Source Code Expand
#include <iostream> #include <algorithm> #include <vector> using namespace std; typedef long long ll; int main(void) { int n, a, b; cin >> n >> a >> b; vector<int> x(n); cin >> x[0]; ll ans = 0; for (int i = 1; i < n; i++) { cin >> x[i]; ans += min(1LL * (x[i] - x[i - 1]) * a, 1LL * b); } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | comethelp |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 365 Byte |
Status | AC |
Exec Time | 44 ms |
Memory | 640 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 | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_balancedmax_01.txt | AC | 43 ms | 640 KB |
subtask_1_balancedmax_02.txt | AC | 44 ms | 640 KB |
subtask_1_max_01.txt | AC | 40 ms | 640 KB |
subtask_1_max_02.txt | AC | 40 ms | 640 KB |
subtask_1_min_01.txt | AC | 1 ms | 256 KB |
subtask_1_onlya_01.txt | AC | 21 ms | 384 KB |
subtask_1_onlyamax_01.txt | AC | 41 ms | 640 KB |
subtask_1_onlyb_01.txt | AC | 11 ms | 384 KB |
subtask_1_onlybmax_01.txt | AC | 41 ms | 640 KB |
subtask_1_rand_01.txt | AC | 27 ms | 512 KB |
subtask_1_rand_02.txt | AC | 34 ms | 512 KB |
subtask_1_rand_03.txt | AC | 16 ms | 384 KB |