Submission #1067320


Source Code Expand

#include <iostream>

using namespace std;

int main() {
    int n, a, b;
    cin >> n >> a >> b;

    int x[n];
    int tmp;
    for (int i = 1; i <= n; i++) {
        cin >> tmp;
        x[i] = tmp;
    }

    int ans = 0;
    for (int i = 1; i <= n - 1; i++) {

        if ((x[i + 1] - x[i]) * a < b && x[i + 1] - x[i] < x[i + 2] - x[i + 1]) {
            ans += (x[i + 1] - x[i]) * a;
        } else {
            ans += b;
        }
    }

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

Submission Info

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 2
WA × 1
AC × 1
WA × 11
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 WA 3 ms 256 KB
sample_03.txt AC 3 ms 256 KB
subtask_1_balancedmax_01.txt WA 48 ms 640 KB
subtask_1_balancedmax_02.txt WA 47 ms 640 KB
subtask_1_max_01.txt WA 48 ms 640 KB
subtask_1_max_02.txt WA 47 ms 640 KB
subtask_1_min_01.txt AC 3 ms 256 KB
subtask_1_onlya_01.txt WA 25 ms 384 KB
subtask_1_onlyamax_01.txt WA 48 ms 640 KB
subtask_1_onlyb_01.txt WA 13 ms 384 KB
subtask_1_onlybmax_01.txt WA 48 ms 640 KB
subtask_1_rand_01.txt WA 31 ms 512 KB
subtask_1_rand_02.txt WA 40 ms 512 KB
subtask_1_rand_03.txt WA 20 ms 384 KB