Submission #1261360
Source Code Expand
#define _USE_MATH_DEFINES #include <cstdio> #include <iostream> #include <sstream> #include <fstream> #include <iomanip> #include <algorithm> #include <cmath> #include <complex> #include <string> #include <vector> #include <list> #include <queue> #include <stack> #include <set> #include <map> #include <bitset> #include <numeric> #include <limits> #include <climits> #include <cfloat> #include <functional> #include <iterator> using namespace std; int main() { int n; long long a, b; cin >> n >> a >> b; vector<long long> x(n); for(int i=0; i<n; ++i) cin >> x[i]; long long ans = 0; for(int i=0; i<n-1; ++i){ long long dx = x[i+1] - x[i]; ans += min(dx * a, b); } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | mamekin |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 808 Byte |
Status | AC |
Exec Time | 41 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 | 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 | 40 ms | 1024 KB |
subtask_1_balancedmax_02.txt | AC | 40 ms | 1024 KB |
subtask_1_max_01.txt | AC | 40 ms | 1024 KB |
subtask_1_max_02.txt | AC | 41 ms | 1024 KB |
subtask_1_min_01.txt | AC | 1 ms | 256 KB |
subtask_1_onlya_01.txt | AC | 21 ms | 640 KB |
subtask_1_onlyamax_01.txt | AC | 41 ms | 1024 KB |
subtask_1_onlyb_01.txt | AC | 11 ms | 384 KB |
subtask_1_onlybmax_01.txt | AC | 41 ms | 1024 KB |
subtask_1_rand_01.txt | AC | 26 ms | 768 KB |
subtask_1_rand_02.txt | AC | 34 ms | 896 KB |
subtask_1_rand_03.txt | AC | 16 ms | 512 KB |