結果

問題 No.1071 ベホマラー
ユーザー peroonperoon
提出日時 2020-07-07 19:29:24
言語 C++14
(gcc 10.1.0 + boost 1.73.0)
結果
AC  
実行時間 235 ms / 2,000 ms
コード長 4,646 Byte
コンパイル時間 1,807 ms
使用メモリ 2,152 KB
最終ジャッジ日時 2020-08-08 14:17:40
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 2 ms
1,592 KB
testcase_01 AC 3 ms
1,588 KB
testcase_02 AC 2 ms
1,592 KB
testcase_03 AC 3 ms
1,592 KB
testcase_04 AC 2 ms
1,588 KB
testcase_05 AC 3 ms
1,588 KB
testcase_06 AC 2 ms
1,592 KB
testcase_07 AC 2 ms
1,588 KB
testcase_08 AC 2 ms
1,588 KB
testcase_09 AC 2 ms
1,592 KB
testcase_10 AC 32 ms
2,148 KB
testcase_11 AC 26 ms
2,152 KB
testcase_12 AC 24 ms
1,884 KB
testcase_13 AC 158 ms
1,884 KB
testcase_14 AC 48 ms
2,148 KB
testcase_15 AC 38 ms
2,148 KB
testcase_16 AC 40 ms
2,148 KB
testcase_17 AC 219 ms
2,148 KB
testcase_18 AC 235 ms
2,148 KB
testcase_19 AC 209 ms
2,148 KB
testcase_20 AC 222 ms
2,148 KB
testcase_21 AC 177 ms
2,148 KB
testcase_22 AC 223 ms
2,152 KB
testcase_23 AC 177 ms
2,152 KB
testcase_24 AC 79 ms
2,148 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
#ifdef LOCAL
    #define _GLIBCXX_DEBUG
    #define __clock__
#else
    #pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;

// tourist set
template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << '\n'; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// tourist set end

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())
#define MP make_pair
#define p_yes() p("Yes")
#define p_no() p("No")

ll SUM(VI& V){
  return accumulate(ALL(V), 0LL);
}

ll MIN(VI& V){return *min_element(ALL(V));}
ll MAX(VI& V){return *max_element(ALL(V));}

void print_vector(VI& V){
  ll n = V.size();
  rep(i, n){
    if(i) cout << ' ';
    cout << V[i];
  }
  cout << endl;
}

ll gcd(ll a,ll b){
    if(b == 0) return a;
    return gcd(b,a%b);
}

ll lcm(ll a,ll b){
    ll g = gcd(a,b);
    return a / g * b;
}

// long double
using ld = long double;
#define EPS (1e-14)
#define equals(a,b) (fabs((a)-(b)) < EPS)

void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}

const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double PI = acos(-1);

using LL = __int128_t;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll N,K,X,Y;
    cin>>N>>K>>X>>Y;

    VI A(N);
    rep(i, N){
      cin >> A[i];
      A[i]--;
    }

    // ベホマラー回数がnの時に必要な合計MP
    auto f = [&](ll n){
      LL mp = Y*n;
      rep(i,N){
        ll r = A[i] - K*n;
        if(r>0){
          // ベホイミ回数
          ll m = (r+K-1)/K;
          mp += X*m;
        }
      }
      return mp;
    };
    
    ll left = 0;
    ll right = 1e9;
    while(right-left>3){
      ll p0 = (2 * left + 1 * right) / 3;
      ll p1 = (1 * left + 2 * right) / 3;
      
      LL mpL = f(left);
      LL mp0 = f(p0);
      LL mp1 = f(p1);
      LL mpR = f(right);

      LL mi = min({mpL, mp0, mp1, mpR});
      if(mi==mpL){
        right = p1;
      }
      else if(mi==mpR){
        left = p0;
      }
      else if(mp0<mp1){
        right = p1;
      }
      else{
        left = p0;
      }
    }

    ll mi = inf;
    FOR(i, left, right+1){
      ll mp = f(i);
      chmin(mi, mp);
    }
    p(mi);
    
    return 0;
}
0