Submission #11459553


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
typedef long long ll;
const long long INF = 1LL << 60;
typedef pair<int, int> P;
int main()
{
    ll N, A, B;
    cin >> N >> A >> B;
    vector<ll> X(N);
    rep(i, N) cin >> X[i];

    ll ans = 0;
    rep(i, N - 1) {
        ll tmp = X[i + 1] - X[i];
        ans += min(tmp * A, B);
    }

    cout << ans << endl;
    return 0;
}

Submission Info

Submission Time
Task D - Walk and Teleport
User wolley
Language C++14 (GCC 5.4.1)
Score 500
Code Size 715 Byte
Status AC
Exec Time 41 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 15
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 1024 KB
subtask_1_balancedmax_02.txt AC 41 ms 1024 KB
subtask_1_max_01.txt AC 41 ms 1024 KB
subtask_1_max_02.txt AC 41 ms 1024 KB
subtask_1_min_01.txt AC 1 ms 256 KB
subtask_1_onlya_01.txt AC 22 ms 640 KB
subtask_1_onlyamax_01.txt AC 41 ms 1024 KB
subtask_1_onlyb_01.txt AC 11 ms 384 KB
subtask_1_onlybmax_01.txt AC 41 ms 1024 KB
subtask_1_rand_01.txt AC 26 ms 768 KB
subtask_1_rand_02.txt AC 34 ms 896 KB
subtask_1_rand_03.txt AC 16 ms 512 KB