Submission #1918955
Source Code Expand
#include<iostream> #include<cstdio> #include<vector> #include<string> #include<cstring> #include<functional> #include<stack> #include<queue> #include <iomanip> #include<map> #include<limits> #include<cmath> #include<algorithm> #include<bitset> #include<utility> #include<complex> #include<cstdlib> #include<set> #include<cctype> #define DBG cerr << '!' << endl; #define REP(i,n) for(ll (i) = (0);(i) < (n);++i) #define rep(i,s,g) for(ll (i) = (s);(i) < (g);++i) #define rrep(i,s,g) for(ll (i) = (s);i >= (g);--(i)) #define PB push_back #define MP make_pair #define FI first #define SE second #define SHOW1d(v,n) {for(int W = 0;W < (n);W++)cerr << v[W] << ' ';cerr << endl << endl;} #define SHOW2d(v,i,j) {for(int aaa = 0;aaa < i;aaa++){for(int bbb = 0;bbb < j;bbb++)cerr << v[aaa][bbb] << ' ';cerr << endl;}cerr << endl;} #define ALL(v) v.begin(),v.end() #define Decimal fixed<<setprecision(10) using namespace std; typedef long long ll; typedef vector<int> iv; typedef vector<iv> iiv; typedef vector<string> sv; int main() { ll n,a,b;cin >> n >> a >> b; vector<ll> v; REP(i,n) { ll tmp;cin >> tmp;v.PB(tmp); } ll ans = 0; REP(i,n-1) { ans += min(a*(v[i+1]-v[i]),b); } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | seica |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1287 Byte |
Status | AC |
Exec Time | 41 ms |
Memory | 1400 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 | 41 ms | 1400 KB |
subtask_1_balancedmax_02.txt | AC | 41 ms | 1400 KB |
subtask_1_max_01.txt | AC | 41 ms | 1400 KB |
subtask_1_max_02.txt | AC | 41 ms | 1400 KB |
subtask_1_min_01.txt | AC | 1 ms | 256 KB |
subtask_1_onlya_01.txt | AC | 22 ms | 892 KB |
subtask_1_onlyamax_01.txt | AC | 41 ms | 1400 KB |
subtask_1_onlyb_01.txt | AC | 11 ms | 640 KB |
subtask_1_onlybmax_01.txt | AC | 41 ms | 1400 KB |
subtask_1_rand_01.txt | AC | 28 ms | 892 KB |
subtask_1_rand_02.txt | AC | 34 ms | 1400 KB |
subtask_1_rand_03.txt | AC | 16 ms | 892 KB |