Submission #1572474


Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <limits>
using namespace std;

double inf = numeric_limits<double>::infinity();

int main() {
    double n, a, b;
    cin >> n >> a >> b;
    
    double x, y;
    cin >> x >> y;
    long cst = 0;
    
    for (int i = 0; i < n - 1; i++) {
        cst += min(a * (y - x), b);
        x = y;
        if (i != n - 2) {
            cin >> y;
        }
    }
    
    cout << cst << endl;
}

Submission Info

Submission Time
Task D - Walk and Teleport
User xuzijian629
Language C++14 (GCC 5.4.1)
Score 500
Code Size 495 Byte
Status AC
Exec Time 60 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 59 ms 256 KB
subtask_1_balancedmax_02.txt AC 59 ms 256 KB
subtask_1_max_01.txt AC 59 ms 256 KB
subtask_1_max_02.txt AC 60 ms 256 KB
subtask_1_min_01.txt AC 1 ms 256 KB
subtask_1_onlya_01.txt AC 31 ms 256 KB
subtask_1_onlyamax_01.txt AC 60 ms 256 KB
subtask_1_onlyb_01.txt AC 15 ms 256 KB
subtask_1_onlybmax_01.txt AC 60 ms 256 KB
subtask_1_rand_01.txt AC 38 ms 256 KB
subtask_1_rand_02.txt AC 50 ms 256 KB
subtask_1_rand_03.txt AC 23 ms 256 KB