Submission #11452895


Source Code Expand

#include <iostream>
#include <vector>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
#define int long long
using namespace std;

signed main() {
    int N, A, B;
    cin >> N >> A >> B;
    vector<int> X(N);
    rep(i, N) cin >> X[i];
    
    int ans = 0;
    rep(i, N - 1) {
        int a = A * (X[i + 1] - X[i]);
        int b = B;
        ans += min(a, b);
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Submission Time
Task D - Walk and Teleport
User Forested
Language C++14 (GCC 5.4.1)
Score 500
Code Size 434 Byte
Status AC
Exec Time 42 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 40 ms 1024 KB
subtask_1_balancedmax_02.txt AC 40 ms 1024 KB
subtask_1_max_01.txt AC 40 ms 1024 KB
subtask_1_max_02.txt AC 40 ms 1024 KB
subtask_1_min_01.txt AC 1 ms 256 KB
subtask_1_onlya_01.txt AC 21 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 42 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