Submission #1065825


Source Code Expand

#include <vector>
#include <list>
#include <map>
#include <set>
#include "queue"
#include <deque>
#include <stack>
#include <numeric>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <complex>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstring>
#include <climits>
#include <cassert>
#include <iostream>
#include "fstream"
using namespace std;
#define PI acos(-1)
#define MOD 1000000007
#define pii pair<long long ,long long >
#define ll  long long int
#define loop(i,n) for(ll i=0;i<n;i++)
#define loop2(i,n) for(ll i = 1;i<=n;i+=1)
#define pb push_back
#define EPS 1e-8
inline ll gcd(ll a, ll b){ ll t; while (b){ a = a%b; t = a; a = b; b = t; }return a; }
using namespace std;





int main()
{
//    freopen("/Users/ashish/Desktop/manic_moving.txt", "r", stdin);
//    freopen("/Users/ashish/Desktop/A-large-practice.out.txt", "w", stdout);
    ll n,a,b;
    cin>>n>>a>>b;
    ll arr[n];
    loop(i,n)
    {
        cin>>arr[i];
    }
    sort(arr,arr+n);
    ll ans  =0 ;
    loop(i,n-1)
    {
        if(a*(arr[i+1]-arr[i])>b)
        {
            ans+=b;
        }
        else{
            ans+=a*(arr[i+1]-arr[i]);
        }
    }
    
    cout<<ans;
    return 0;
}

Submission Info

Submission Time
Task D - Walk and Teleport
User StillHungry
Language C++14 (GCC 5.4.1)
Score 500
Code Size 1400 Byte
Status AC
Exec Time 71 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 66 ms 1024 KB
subtask_1_balancedmax_02.txt AC 64 ms 1024 KB
subtask_1_max_01.txt AC 67 ms 1024 KB
subtask_1_max_02.txt AC 70 ms 1024 KB
subtask_1_min_01.txt AC 3 ms 256 KB
subtask_1_onlya_01.txt AC 36 ms 640 KB
subtask_1_onlyamax_01.txt AC 71 ms 1024 KB
subtask_1_onlyb_01.txt AC 18 ms 384 KB
subtask_1_onlybmax_01.txt AC 70 ms 1024 KB
subtask_1_rand_01.txt AC 45 ms 768 KB
subtask_1_rand_02.txt AC 59 ms 896 KB
subtask_1_rand_03.txt AC 27 ms 512 KB