Submission #1065638
Source Code Expand
#include <bits/stdc++.h> using namespace std; const int MAX_N = 1e5; long long n, a, b; long long x[MAX_N]; long long ans; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> a >> b; for (int i = 0; i < n; i++) { cin >> x[i]; if (i == 0) { continue; } ans += min(b, (x[i] - x[i - 1]) * a); } cout << ans << "\n"; }
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | trilis |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 440 Byte |
Status | AC |
Exec Time | 15 ms |
Memory | 1024 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 | 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 | 3 ms | 256 KB |
sample_02.txt | AC | 3 ms | 256 KB |
sample_03.txt | AC | 3 ms | 256 KB |
subtask_1_balancedmax_01.txt | AC | 15 ms | 1024 KB |
subtask_1_balancedmax_02.txt | AC | 14 ms | 1024 KB |
subtask_1_max_01.txt | AC | 14 ms | 1024 KB |
subtask_1_max_02.txt | AC | 14 ms | 1024 KB |
subtask_1_min_01.txt | AC | 3 ms | 256 KB |
subtask_1_onlya_01.txt | AC | 8 ms | 640 KB |
subtask_1_onlyamax_01.txt | AC | 14 ms | 1024 KB |
subtask_1_onlyb_01.txt | AC | 5 ms | 512 KB |
subtask_1_onlybmax_01.txt | AC | 14 ms | 1024 KB |
subtask_1_rand_01.txt | AC | 10 ms | 768 KB |
subtask_1_rand_02.txt | AC | 12 ms | 896 KB |
subtask_1_rand_03.txt | AC | 7 ms | 512 KB |