Submission #1070983
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; int main() { ll n; ll a,b; ll ans = 0; ll x[n]; cin >> n >> a >> b; for (int i = 0; i < n; i++) { cin >> x[i]; } for (int i = 0; i < n - 1; i++) { ll dif = x[i + 1] - x[i]; ll cost = dif * a; if (cost < b) { ans += cost; } else { ans += b; } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | aiyo |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 444 Byte |
Status | AC |
Exec Time | 68 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 | 66 ms | 1024 KB |
subtask_1_balancedmax_02.txt | AC | 67 ms | 1024 KB |
subtask_1_max_01.txt | AC | 66 ms | 1024 KB |
subtask_1_max_02.txt | AC | 62 ms | 1024 KB |
subtask_1_min_01.txt | AC | 3 ms | 256 KB |
subtask_1_onlya_01.txt | AC | 36 ms | 640 KB |
subtask_1_onlyamax_01.txt | AC | 58 ms | 1024 KB |
subtask_1_onlyb_01.txt | AC | 18 ms | 384 KB |
subtask_1_onlybmax_01.txt | AC | 68 ms | 1024 KB |
subtask_1_rand_01.txt | AC | 44 ms | 768 KB |
subtask_1_rand_02.txt | AC | 57 ms | 896 KB |
subtask_1_rand_03.txt | AC | 27 ms | 512 KB |