Submission #1066318
Source Code Expand
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <utility>
#include <memory>
#include <functional>
#include <deque>
#include <cctype>
#include <ctime>
#include <numeric>
#include <list>
#include <iomanip>
#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <forward_list>
#define cauto const auto&
#else
#endif
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;
#define VV(T) vector<vector< T > >
template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
v.assign(a, vector<T>(b, t));
}
template <class F, class T>
void convert(const F &f, T &t){
stringstream ss;
ss << f;
ss >> t;
}
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()
#define DEBUG
#ifdef DEBUG
#define dump(x) cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x)
#define debug(x)
#endif
#define MOD 1000000007LL
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)
void mainmain(){
int n;
cin>>n;
ll A,B;
cin>>A>>B;
ll ans = 0;
vint v(n);
rep(i,n) cin>>v[i];
rep(i,n-1){
if((v[i+1]-v[i])*A<B){
ans += (v[i+1]-v[i])*A;
}
else{
ans += B;
}
}
cout<<ans<<endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout<<fixed<<setprecision(20);
mainmain();
}
Submission Info
Submission Time |
|
Task |
D - Walk and Teleport |
User |
j_gui0121 |
Language |
C++14 (GCC 5.4.1) |
Score |
500 |
Code Size |
2402 Byte |
Status |
AC |
Exec Time |
13 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 |
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 |
13 ms |
640 KB |
subtask_1_balancedmax_02.txt |
AC |
13 ms |
640 KB |
subtask_1_max_01.txt |
AC |
13 ms |
640 KB |
subtask_1_max_02.txt |
AC |
13 ms |
640 KB |
subtask_1_min_01.txt |
AC |
3 ms |
256 KB |
subtask_1_onlya_01.txt |
AC |
8 ms |
512 KB |
subtask_1_onlyamax_01.txt |
AC |
13 ms |
640 KB |
subtask_1_onlyb_01.txt |
AC |
5 ms |
384 KB |
subtask_1_onlybmax_01.txt |
AC |
13 ms |
640 KB |
subtask_1_rand_01.txt |
AC |
9 ms |
512 KB |
subtask_1_rand_02.txt |
AC |
11 ms |
640 KB |
subtask_1_rand_03.txt |
AC |
6 ms |
384 KB |