Submission #1987159
Source Code Expand
#include <iostream> #include <algorithm> using namespace std; typedef long long ll; int main(void) { int n; ll a, b; cin >> n >> a >> b; ll l, r; cin >> l; ll ans = 0; for (int i = 1; i < n; i++) { cin >> r; ans += min((r - l) * a, b); l = r; } 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 | 327 Byte |
Status | AC |
Exec Time | 40 ms |
Memory | 256 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 | 40 ms | 256 KB |
subtask_1_balancedmax_02.txt | AC | 40 ms | 256 KB |
subtask_1_max_01.txt | AC | 40 ms | 256 KB |
subtask_1_max_02.txt | AC | 40 ms | 256 KB |
subtask_1_min_01.txt | AC | 1 ms | 256 KB |
subtask_1_onlya_01.txt | AC | 21 ms | 256 KB |
subtask_1_onlyamax_01.txt | AC | 40 ms | 256 KB |
subtask_1_onlyb_01.txt | AC | 11 ms | 256 KB |
subtask_1_onlybmax_01.txt | AC | 40 ms | 256 KB |
subtask_1_rand_01.txt | AC | 25 ms | 256 KB |
subtask_1_rand_02.txt | AC | 33 ms | 256 KB |
subtask_1_rand_03.txt | AC | 15 ms | 256 KB |