Submission #1066391


Source Code Expand

#include <cstdio>

using namespace std;

typedef long long ll;

static const ll MOD = 1000000007LL;

int main()
{
    ll N;
    ll A, B;
    ll X, prevX;
    ll dist, walk;
    ll tiredness = 0;

    scanf("%lld %lld %lld", &N, &A, &B);

    ll i;

    scanf("%lld", &prevX);

    for (i = 1; i < N; i++) {
        scanf("%lld", &X);

        dist = X - prevX;
        walk = dist * A;

        if (walk < B) tiredness += walk;
        else tiredness += B;

        prevX = X;
    }

    printf("%lld\n", tiredness);

    return 0;
}

Submission Info

Submission Time
Task D - Walk and Teleport
User ishibashijun
Language C++14 (GCC 5.4.1)
Score 500
Code Size 572 Byte
Status AC
Exec Time 13 ms
Memory 128 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:17:40: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld %lld %lld", &N, &A, &B);
                                        ^
./Main.cpp:21:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld", &prevX);
                          ^
./Main.cpp:24:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld", &X);
                          ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 12
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 1 ms 128 KB
sample_02.txt AC 1 ms 128 KB
sample_03.txt AC 1 ms 128 KB
subtask_1_balancedmax_01.txt AC 12 ms 128 KB
subtask_1_balancedmax_02.txt AC 12 ms 128 KB
subtask_1_max_01.txt AC 13 ms 128 KB
subtask_1_max_02.txt AC 13 ms 128 KB
subtask_1_min_01.txt AC 1 ms 128 KB
subtask_1_onlya_01.txt AC 7 ms 128 KB
subtask_1_onlyamax_01.txt AC 13 ms 128 KB
subtask_1_onlyb_01.txt AC 4 ms 128 KB
subtask_1_onlybmax_01.txt AC 13 ms 128 KB
subtask_1_rand_01.txt AC 8 ms 128 KB
subtask_1_rand_02.txt AC 11 ms 128 KB
subtask_1_rand_03.txt AC 5 ms 128 KB