Submission #1065409


Source Code Expand

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

#define FOR(i,l,r) for(int i = (int) (l);i < (int) (r);i++)
#define ALL(x) x.begin(),x.end()
template<typename T> bool chmax(T& a,const T& b){ return a < b ? (a = b,true) : false; }
template<typename T> bool chmin(T& a,const T& b){ return b < a ? (a = b,true) : false; }
typedef long long ll;

int N;
ll A,B;

int main()
{
	scanf("%d%lld%lld",&N,&A,&B);
	vector<ll> X(N),diff(N - 1);
	FOR(i,0,N){
		scanf("%lld",&X [i]);
	}
	FOR(i,0,N - 1){
		diff [i] = X [i + 1] - X [i];
	}
	sort(ALL(diff),greater<ll>());

	ll sum = accumulate(ALL(diff),0ll) * A,ans = sum;
	FOR(i,0,N - 1){
		sum += B - diff [i] * A;
		chmin(ans,sum);
	}

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

	return 0;
}

Submission Info

Submission Time
Task D - Walk and Teleport
User gigime
Language C++14 (GCC 5.4.1)
Score 500
Code Size 744 Byte
Status AC
Exec Time 22 ms
Memory 1792 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:15:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%lld%lld",&N,&A,&B);
                              ^
./Main.cpp:18:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&X [i]);
                       ^

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 2 ms 256 KB
sample_02.txt AC 2 ms 256 KB
sample_03.txt AC 2 ms 256 KB
subtask_1_balancedmax_01.txt AC 21 ms 1792 KB
subtask_1_balancedmax_02.txt AC 22 ms 1792 KB
subtask_1_max_01.txt AC 21 ms 1792 KB
subtask_1_max_02.txt AC 21 ms 1792 KB
subtask_1_min_01.txt AC 2 ms 256 KB
subtask_1_onlya_01.txt AC 12 ms 1024 KB
subtask_1_onlyamax_01.txt AC 21 ms 1792 KB
subtask_1_onlyb_01.txt AC 7 ms 640 KB
subtask_1_onlybmax_01.txt AC 21 ms 1792 KB
subtask_1_rand_01.txt AC 14 ms 1280 KB
subtask_1_rand_02.txt AC 18 ms 1536 KB
subtask_1_rand_03.txt AC 9 ms 768 KB