Submission #1365881
Source Code Expand
#include <iostream> #include <vector> int main() { unsigned N, A, B; std::cin >> N >> A >> B; std::vector<unsigned> X(N); for (unsigned i = 0; i < N; ++i) { std::cin >> X[i]; } unsigned long long ans = 0ull; for (unsigned i = 1; i < N; ++i) { if (X[i] - X[i-1] > B / A) { ans += B; } else { ans += (X[i] - X[i-1]) * A; } } std::cout << ans; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | ytsmiling |
Language | C++14 (Clang 3.8.0) |
Score | 500 |
Code Size | 421 Byte |
Status | AC |
Exec Time | 110 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 | 108 ms | 640 KB |
subtask_1_balancedmax_02.txt | AC | 108 ms | 640 KB |
subtask_1_max_01.txt | AC | 108 ms | 640 KB |
subtask_1_max_02.txt | AC | 108 ms | 640 KB |
subtask_1_min_01.txt | AC | 1 ms | 256 KB |
subtask_1_onlya_01.txt | AC | 56 ms | 512 KB |
subtask_1_onlyamax_01.txt | AC | 110 ms | 640 KB |
subtask_1_onlyb_01.txt | AC | 27 ms | 384 KB |
subtask_1_onlybmax_01.txt | AC | 108 ms | 640 KB |
subtask_1_rand_01.txt | AC | 69 ms | 512 KB |
subtask_1_rand_02.txt | AC | 90 ms | 640 KB |
subtask_1_rand_03.txt | AC | 41 ms | 384 KB |