Submission #1163899

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

const double pi  = 2 * acos(0.0);
const double eps = 1e-8;

#define REP(i,a,b) for(int i=(a); i<(b);++i)
#define rep(i,n) REP(i,0,n)
#define INF (1<<29)
#define INFLL (1LL<<62)

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

typedef int Cost;
struct Edge {
  int src, dst; Cost cost;
  Edge(int s, int d, Cost c) : src(s), dst(d), cost(c) {}
};

typedef vector<Edge>  Edges;
typedef vector<Edges> Graph;
typedef vector<Cost>  Array;
typedef vector<Array> Matrix;

int dx[8] = {0, 1, 0, -1, 1, -1, 1, -1};
int dy[8] = {1, 0, -1, 0, 1, -1, -1, 1};

ll mod = 1e9 + 7;
bool sieve[1001];
int cnt[1001];

void make_sieve(void) {
  rep(i, 1001) sieve[i] = true;
  sieve[0] = sieve[1] = false;
  for (int i = 2; i * i <= 1000; i++) {
    if (!sieve[i]) continue;
    for (int j = i + i; j <= 1000; j += i)
      sieve[j] = false;
  }
}

int main(void) {
  ios_base::sync_with_stdio(false); cin.tie(0);
  ll N, A, B;

  cin >> N >> A >> B;
  vector<int> X(N);
  rep(i, N) cin >> X[i];

  ll res = 0;
  rep(i, N-1) {
    ll d = X[i+1] - X[i];
    if (d * A < B) res += d * A;
    else res += B;
  }

  cout << res << endl;
  return 0; 
}

Submission Info

Judge Result