Submission #1080395


Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstring>
//#include<vector>
#include<algorithm>


#ifdef L_JUDGE
#pragma warning(disable:4996)
#endif

using namespace std;
typedef long long int LL;
const int MAXN=1e5+10;

LL X[MAXN];
LL N;
LL A,B;


int main(){
	#ifdef L_JUDGE
		freopen("in.txt","r",stdin);
//		freopen("out.txt","w",stdout);
	#endif
    cin.sync_with_stdio(false);
    cin>>N>>A>>B;
    for(int ni=1;ni<=N;ni++){
         cin>>X[ni];
    }
    LL ans=0;
    for(int ni=2;ni<=N;ni++){
        LL dist=X[ni]-X[ni-1];
        ans=ans+min(dist*A,B);
    }
    printf("%lld\n",ans);

	#ifdef L_JUDGE
		fclose(stdin);
		fclose(stdout);
//		system("out.txt");
	#endif

	return 0;
}

Submission Info

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

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 3 ms 256 KB
sample_02.txt AC 3 ms 256 KB
sample_03.txt AC 3 ms 256 KB
subtask_1_balancedmax_01.txt AC 14 ms 1024 KB
subtask_1_balancedmax_02.txt AC 14 ms 1024 KB
subtask_1_max_01.txt AC 14 ms 1024 KB
subtask_1_max_02.txt AC 14 ms 1024 KB
subtask_1_min_01.txt AC 3 ms 256 KB
subtask_1_onlya_01.txt AC 9 ms 640 KB
subtask_1_onlyamax_01.txt AC 14 ms 1024 KB
subtask_1_onlyb_01.txt AC 5 ms 512 KB
subtask_1_onlybmax_01.txt AC 14 ms 1024 KB
subtask_1_rand_01.txt AC 10 ms 768 KB
subtask_1_rand_02.txt AC 12 ms 896 KB
subtask_1_rand_03.txt AC 7 ms 512 KB