Submission #2744473


Source Code Expand

#include <iostream>
#include <vector>
#include <math.h>
using namespace std;

int main(){
        int N,A,B;
        cin >> N >> A >> B;
        unsigned long long ans = 0;

        vector <int> array(N,0);

        for(int i=0; i<N; i++) {
                cin >> array[i];
        }
        for(int i=0; i<N-1; i++) {
                ans += min((array[i+1]-array[i])*A,B);
        }

        cout << ans << endl;
}

Submission Info

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 500
Status
AC × 3
AC × 6
WA × 9
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 WA 40 ms 640 KB
subtask_1_balancedmax_02.txt WA 40 ms 640 KB
subtask_1_max_01.txt WA 40 ms 640 KB
subtask_1_max_02.txt WA 40 ms 640 KB
subtask_1_min_01.txt AC 1 ms 256 KB
subtask_1_onlya_01.txt AC 21 ms 384 KB
subtask_1_onlyamax_01.txt AC 41 ms 640 KB
subtask_1_onlyb_01.txt WA 11 ms 384 KB
subtask_1_onlybmax_01.txt WA 41 ms 640 KB
subtask_1_rand_01.txt WA 28 ms 512 KB
subtask_1_rand_02.txt WA 34 ms 512 KB
subtask_1_rand_03.txt WA 16 ms 384 KB