Submission #11435757
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vector<pdd> vdd;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define mem(a,b) memset(a, b, sizeof(a) )
#define all(x) (x).begin(),(x).end()
#define INF 1000000000000
#define MOD 1000000007
#define PB push_back
#define MP make_pair
#define F first
#define S second
inline void normal(ll &a) { a %= MOD; (a < 0) && (a += MOD); }
inline ll modMul(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a*b)%MOD; }
inline ll modAdd(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); return (a+b)%MOD; }
inline ll modSub(ll a, ll b) { a %= MOD, b %= MOD; normal(a), normal(b); a -= b; normal(a); return a; }
inline ll modPow(ll b, ll p) { ll r = 1; while(p) { if(p&1) r = modMul(r, b); b = modMul(b, b); p >>= 1; } return r; }
inline ll modInverse(ll a) { return modPow(a, MOD-2); }
inline ll modDiv(ll a, ll b) { return modMul(a, modInverse(b)); }
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
int main(){
ll n,a,b;cin>>n>>a>>b;
vl x(n),d(n);
rep(i,n)cin>>x[i];
for(int i=1;i<n;++i){
d[i]=x[i]-x[i-1];
}
ll ans=0;
for(int i=1;i<n;++i){
ans+=min(a*d[i],b);
}
cout<<ans<<endl;
}
Submission Info
Submission Time |
|
Task |
D - Walk and Teleport |
User |
nishiyama |
Language |
C++14 (GCC 5.4.1) |
Score |
500 |
Code Size |
1685 Byte |
Status |
AC |
Exec Time |
42 ms |
Memory |
1792 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 |
1792 KB |
subtask_1_balancedmax_02.txt |
AC |
41 ms |
1792 KB |
subtask_1_max_01.txt |
AC |
41 ms |
1792 KB |
subtask_1_max_02.txt |
AC |
41 ms |
1792 KB |
subtask_1_min_01.txt |
AC |
1 ms |
256 KB |
subtask_1_onlya_01.txt |
AC |
22 ms |
1024 KB |
subtask_1_onlyamax_01.txt |
AC |
42 ms |
1792 KB |
subtask_1_onlyb_01.txt |
AC |
11 ms |
640 KB |
subtask_1_onlybmax_01.txt |
AC |
41 ms |
1792 KB |
subtask_1_rand_01.txt |
AC |
28 ms |
1280 KB |
subtask_1_rand_02.txt |
AC |
34 ms |
1536 KB |
subtask_1_rand_03.txt |
AC |
16 ms |
768 KB |