Submission #1070631
Source Code Expand
#include <iostream> #include <algorithm> #include <string> #include <map> #include <vector> using namespace std; int main() { long long n, a, b, c; long long x[100000]; long long ans = 0; cin >> n >> a >> b; for (int i = 0; i < n; i++) { cin >> x[i]; } for (int i = 0; i < n - 1; i++) { c = x[i + 1] - x[i]; if (b > c*a) { ans += c*a; } else { ans += b; } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | AMeararEX |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 447 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 | 2 ms | 256 KB |
sample_03.txt | AC | 3 ms | 256 KB |
subtask_1_balancedmax_01.txt | AC | 67 ms | 1024 KB |
subtask_1_balancedmax_02.txt | AC | 68 ms | 1024 KB |
subtask_1_max_01.txt | AC | 68 ms | 1024 KB |
subtask_1_max_02.txt | AC | 68 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 | 65 ms | 1024 KB |
subtask_1_onlyb_01.txt | AC | 15 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 |