Submission #1097096
Source Code Expand
#include <iostream> #include <cmath> using namespace std; using ll = long long; int main() { ll N, A, B; cin >> N >> A >> B; ll prev = 0; cin >> prev; ll res = 0; for(int i=1; i<N; ++i) { ll next = 0; cin >> next; res += min((next - prev) * A, B); prev = next; } cout << res << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | Suibaka |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 370 Byte |
Status | AC |
Exec Time | 69 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 | 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 | 68 ms | 256 KB |
subtask_1_balancedmax_02.txt | AC | 65 ms | 256 KB |
subtask_1_max_01.txt | AC | 64 ms | 256 KB |
subtask_1_max_02.txt | AC | 65 ms | 256 KB |
subtask_1_min_01.txt | AC | 3 ms | 256 KB |
subtask_1_onlya_01.txt | AC | 36 ms | 256 KB |
subtask_1_onlyamax_01.txt | AC | 69 ms | 256 KB |
subtask_1_onlyb_01.txt | AC | 17 ms | 256 KB |
subtask_1_onlybmax_01.txt | AC | 65 ms | 256 KB |
subtask_1_rand_01.txt | AC | 44 ms | 256 KB |
subtask_1_rand_02.txt | AC | 54 ms | 256 KB |
subtask_1_rand_03.txt | AC | 23 ms | 256 KB |