fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14.     int x = 1;
  15.     a %= mod;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % mod; 
  18.         a = (a * a) % mod;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<int> a;
  31.  
  32. int consistency(int n, int c, int d){
  33.  
  34.     a.push_back(0);
  35.     n = a.size();  
  36.  
  37.     sort(begin(a), end(a));
  38.  
  39.     int cost = 0;
  40.  
  41.     vector<int> b;
  42.     for(int i=0; i<n; ){
  43.         b.push_back(a[i]);
  44.  
  45.         int j = i+1;
  46.         while(j<n && a[j] == a[i]) j++;
  47.         cost += (j-i-1)*c;
  48.         i = j;
  49.     }
  50.  
  51.  
  52.     n = b.size();
  53.     vector<int> diff(n-1);
  54.  
  55.     for(int i=1; i<n; i++){
  56.         diff[i-1] = b[i] - b[i-1] - 1;
  57.     }
  58.  
  59.     for(int i=1; i<n-1; i++){
  60.         diff[i] += diff[i-1];
  61.     }
  62.  
  63.     int mini = c*(n-1) + d*1;
  64.  
  65.     for(int i=1; i<n; i++){
  66.         int cost = c*((n-1)-i) + d*diff[i-1];
  67.         mini = min(mini, cost);
  68.     }
  69.  
  70.     return mini+cost;
  71. }
  72.  
  73.  
  74.  
  75.  
  76.  
  77.  
  78.  
  79.  
  80.  
  81.  
  82.  
  83.  
  84.  
  85.  
  86.  
  87. int practice(int n, int c, int d){
  88.  
  89.  
  90.     return 0;
  91. }
  92.  
  93.  
  94.  
  95.  
  96.  
  97. void solve() {
  98.  
  99.     int n, c, d;
  100.     cin>> n >> c >> d;
  101.  
  102.     a.resize(n);
  103.     for(int i=0; i<n; i++) cin >> a[i];
  104.  
  105.     cout << consistency(n, c, d) << endl;
  106.  
  107.  
  108. }
  109.  
  110.  
  111.  
  112.  
  113.  
  114. int32_t main() {
  115.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  116.  
  117.     int t = 1;
  118.     cin >> t;
  119.     while (t--) {
  120.         solve();
  121.     }
  122.  
  123.     return 0;
  124. }
Success #stdin #stdout 0s 5312KB
comments (?)
stdin
copy 
4
6 2 4
2 5 7 8 12 13
6 5 2
2 5 7 8 12 13
6 3 3
2 5 7 8 12 13
6 2 8
7 3 5 4 4 8
stdout
copy 
14
14
18
20
https://ideone.com/NFF2qs
language:
C++14 (gcc 8.3)
created:
1 hour ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!