Submission #1695592


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define rep(i,b) FOR(i,0,b)
#define INF mugen
#define dump(x) cerr<<#x<<"="<<x<<endl
#define all(a) (a).begin(),(a).end()
typedef vector<int> V;
typedef vector<V> VV;
typedef vector<VV> VVV;
template <class T> void chmin(T & a, T const & b) { if (b < a) a = b; }

using ll = long long;
const ll mod = LLONG_MAX;


int X[100010];
int ans;
int main(){
  int N;
  int A,B;


  cin>>N>>A>>B;

  rep(i,N){
    cin>>X[i];
  }
  rep(i,N-1){
    ans+=min((X[i+1]-X[i])*A,B);
  }
  cout<<ans<<endl;


}

Submission Info

Submission Time
Task D - Walk and Teleport
User albicilla
Language C++14 (GCC 5.4.1)
Score 0
Code Size 615 Byte
Status WA
Exec Time 55 ms
Memory 640 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 3
AC × 4
WA × 11
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 WA 52 ms 640 KB
subtask_1_balancedmax_02.txt WA 55 ms 640 KB
subtask_1_max_01.txt WA 53 ms 640 KB
subtask_1_max_02.txt WA 54 ms 640 KB
subtask_1_min_01.txt AC 1 ms 256 KB
subtask_1_onlya_01.txt WA 28 ms 384 KB
subtask_1_onlyamax_01.txt WA 54 ms 640 KB
subtask_1_onlyb_01.txt WA 14 ms 384 KB
subtask_1_onlybmax_01.txt WA 54 ms 640 KB
subtask_1_rand_01.txt WA 34 ms 512 KB
subtask_1_rand_02.txt WA 45 ms 512 KB
subtask_1_rand_03.txt WA 20 ms 384 KB