Submission #11469350


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
long long arr[1000000],arr1[1000000];
map <long long, long long > cnt;
int main()
{
    ios_base::sync_with_stdio(false); 
    cin.tie(NULL);    
    long long n,a,b,k,i,j,x,y;
    cin>>n>>a>>b;
    for (i=0;i<n;i++)
    {
    	cin>>arr[i];
	}
	y=0;
	for (i=1;i<n;i++)
	{
		x=(arr[i]-arr[i-1])*a;
		y=y+min(x,b);
	}
	cout<<y<<endl;
}

Submission Info

Submission Time
Task D - Walk and Teleport
User Amitesh99
Language C++14 (GCC 5.4.1)
Score 500
Code Size 399 Byte
Status AC
Exec Time 11 ms
Memory 4352 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 2 ms 2304 KB
sample_02.txt AC 2 ms 2304 KB
sample_03.txt AC 1 ms 2304 KB
subtask_1_balancedmax_01.txt AC 11 ms 4352 KB
subtask_1_balancedmax_02.txt AC 11 ms 4352 KB
subtask_1_max_01.txt AC 11 ms 4352 KB
subtask_1_max_02.txt AC 11 ms 4352 KB
subtask_1_min_01.txt AC 2 ms 2304 KB
subtask_1_onlya_01.txt AC 7 ms 4352 KB
subtask_1_onlyamax_01.txt AC 11 ms 4352 KB
subtask_1_onlyb_01.txt AC 4 ms 2304 KB
subtask_1_onlybmax_01.txt AC 11 ms 4352 KB
subtask_1_rand_01.txt AC 8 ms 4352 KB
subtask_1_rand_02.txt AC 10 ms 4352 KB
subtask_1_rand_03.txt AC 5 ms 2304 KB