Submission #1077828
Source Code Expand
#include <iostream> #include <vector> #define REP(i, n) for(long long i = 0; i < n; ++i) #define RANGE(i, x, n) for(long long i = x; i < n; ++i) using namespace std; int main() { long long N, A, B; cin >> N >> A >> B; vector<long long> P(N, 0); REP(i, N) { cin >> P[i]; } long long ans = 0; REP(i, N - 1) { ans += min(B, A * (P[i + 1] - P[i])); } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | lastpoet |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 441 Byte |
Status | AC |
Exec Time | 44 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 | 44 ms | 1024 KB |
subtask_1_balancedmax_02.txt | AC | 43 ms | 1024 KB |
subtask_1_max_01.txt | AC | 43 ms | 1024 KB |
subtask_1_max_02.txt | AC | 43 ms | 1024 KB |
subtask_1_min_01.txt | AC | 3 ms | 256 KB |
subtask_1_onlya_01.txt | AC | 24 ms | 640 KB |
subtask_1_onlyamax_01.txt | AC | 43 ms | 1024 KB |
subtask_1_onlyb_01.txt | AC | 13 ms | 384 KB |
subtask_1_onlybmax_01.txt | AC | 43 ms | 1024 KB |
subtask_1_rand_01.txt | AC | 29 ms | 768 KB |
subtask_1_rand_02.txt | AC | 37 ms | 896 KB |
subtask_1_rand_03.txt | AC | 18 ms | 512 KB |