Submission #2206470


Source Code Expand

#include<iostream>
using namespace std;
int main(){
    long N,A,B;
    long Xb,X,ans = 0;
    cin >> N >> A >> B;
    cin >> Xb;
    for(int i=1;i<N;i++){
        cin >> X;
        ans += A*(X-Xb) < B? A*(X-Xb) : B;
        Xb = X;
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Submission Time
Task D - Walk and Teleport
User yankeiori
Language C++14 (GCC 5.4.1)
Score 500
Code Size 295 Byte
Status AC
Exec Time 54 ms
Memory 256 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 52 ms 256 KB
subtask_1_balancedmax_02.txt AC 53 ms 256 KB
subtask_1_max_01.txt AC 52 ms 256 KB
subtask_1_max_02.txt AC 53 ms 256 KB
subtask_1_min_01.txt AC 1 ms 256 KB
subtask_1_onlya_01.txt AC 28 ms 256 KB
subtask_1_onlyamax_01.txt AC 53 ms 256 KB
subtask_1_onlyb_01.txt AC 14 ms 256 KB
subtask_1_onlybmax_01.txt AC 54 ms 256 KB
subtask_1_rand_01.txt AC 33 ms 256 KB
subtask_1_rand_02.txt AC 44 ms 256 KB
subtask_1_rand_03.txt AC 20 ms 256 KB