Submission #3422671


Source Code Expand

#include<bits/stdc++.h>
using namespace std;

using ll = long long int;
using vi = vector<int>;
using vll = vector<long long int>;
using vii = vector<vi>;
using pii = pair<int, int>;

#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)
#define FOR(i, a, b) for(int (i) = a; (i) < (b);(i)++)
#define MAX(a, b) ((a > b) ? a : b)
#define MIN(a, b) ((a > b) ? b : a)

int gcd(int a,int b){return b?gcd(b,a%b):a;}
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

const int QUA = 1e9 + 7;

int main(){
  ll n, a, b;
  scanf("%lld%lld%lld", &n, &a, &b);
  ll P, Q, ans = 0;
  scanf("%lld", &P);
  REP(i, n - 1){
    scanf("%d", &Q);
    ans += MIN(a * (Q - P), b);
    P = Q;
  }
  printf("%lld\n", ans);
  return 0;
}

Submission Info

Submission Time
Task D - Walk and Teleport
User arounderstand
Language C++14 (GCC 5.4.1)
Score 500
Code Size 733 Byte
Status AC
Exec Time 12 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:27:19: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘ll* {aka long long int*}’ [-Wformat=]
     scanf("%d", &Q);
                   ^
./Main.cpp:23:36: 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:25:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &P);
                    ^
./Main.cpp:27:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &Q);
                    ^

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 12 ms 256 KB
subtask_1_balancedmax_02.txt AC 12 ms 256 KB
subtask_1_max_01.txt AC 12 ms 256 KB
subtask_1_max_02.txt AC 12 ms 256 KB
subtask_1_min_01.txt AC 1 ms 256 KB
subtask_1_onlya_01.txt AC 7 ms 256 KB
subtask_1_onlyamax_01.txt AC 12 ms 256 KB
subtask_1_onlyb_01.txt AC 4 ms 256 KB
subtask_1_onlybmax_01.txt AC 12 ms 256 KB
subtask_1_rand_01.txt AC 8 ms 256 KB
subtask_1_rand_02.txt AC 10 ms 256 KB
subtask_1_rand_03.txt AC 5 ms 256 KB