Submission #1087899


Source Code Expand

#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>

#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define all(v) begin(v), end(v)
#define debug(x) cerr<< #x <<": "<<x<<endl
#define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
typedef vector<vector<ll> > vvll;
template<class T> using vv=vector<vector< T > >;

int main() {
  ll n, a, b;
  scanf("%lld %lld %lld", &n, &a, &b);
  vll x(n);
  vll d(n-1);
  scanf("%lld", &x[0]);
  FOR (i, 1, n) {
    scanf("%lld", &x[i]);
    d[i-1] = x[i] - x[i-1];
  }
  ll ans = 0;
  rep (i, n-1) {
    ans += min(b, a * d[i]);
  }
  printf("%lld\n", ans);

  return 0;
}

Submission Info

Submission Time
Task D - Walk and Teleport
User tspcx
Language C++14 (Clang 3.8.0)
Score 500
Code Size 1211 Byte
Status AC
Exec Time 17 ms
Memory 1792 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 12
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 17 ms 1792 KB
subtask_1_balancedmax_02.txt AC 17 ms 1792 KB
subtask_1_max_01.txt AC 17 ms 1792 KB
subtask_1_max_02.txt AC 17 ms 1792 KB
subtask_1_min_01.txt AC 3 ms 256 KB
subtask_1_onlya_01.txt AC 10 ms 1024 KB
subtask_1_onlyamax_01.txt AC 17 ms 1792 KB
subtask_1_onlyb_01.txt AC 6 ms 640 KB
subtask_1_onlybmax_01.txt AC 17 ms 1792 KB
subtask_1_rand_01.txt AC 12 ms 1280 KB
subtask_1_rand_02.txt AC 15 ms 1536 KB
subtask_1_rand_03.txt AC 9 ms 768 KB