結果
| 問題 | No.1071 ベホマラー |
| ユーザー |
 ganariya
|
| 提出日時 | 2020-06-05 22:06:33 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 81 ms / 2,000 ms |
| コード長 | 8,593 bytes |
| コンパイル時間 | 2,500 ms |
| コンパイル使用メモリ | 159,952 KB |
| 最終ジャッジ日時 | 2025-01-10 22:35:22 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 5 |
| other | AC * 20 |
ソースコード
//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <unordered_map>
#include <climits>
#include <set>
#include <unordered_set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>
#include <random>
#include <chrono>
#include <complex>
#include <regex>
#include <locale>
#include <random>
#include <cassert>
#include <type_traits>
using namespace std;
// typedef
//------------------------------------------
typedef long long LL;
typedef vector<int> VI;
typedef vector<bool> VB;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<LL> VLL;
typedef vector<VI> VVI;
typedef vector<VB> VVB;
typedef vector<VS> VVS;
typedef vector<VLL> VVLL;
typedef vector<VVI> VVVI;
typedef vector<VVLL> VVVLL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<int, string> PIS;
typedef pair<string, int> PSI;
typedef pair<string, string> PSS;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef vector<VPII> VVPII;
typedef vector<VPLL> VVPLL;
typedef vector<VS> VVS;
typedef map<int, int> MII;
typedef map<LL, LL> MLL;
typedef map<string, int> MSI;
typedef map<int, string> MIS;
// container util
//------------------------------------------
#define ALL(a) (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define EACH(i, arr) for(typeof((arr).begin()) i=(arr).begin(); i!=(arr).end(); ++i)
#define EXIST(str, e) ((str).find(e)!=(str).end())
#define COUNT(arr, v) count((arr).begin(), (arr).end(), v)
#define SEARCH(v, w) search((v).begin(), (v).end(), (w).begin(), (w).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define ROTATE_LEFT(arr, c) rotate((arr).begin(), (arr).begin()+(c), (arr).end())
#define ROTATE_RIGHT(arr, c) rotate((arr).rbegin(), (arr).rbegin() + (c), (arr).rend())
#define SUMI(arr) accumulate((arr).begin(), (arr).end(), 0)
#define SUMD(arr) accumulate((arr).begin(), (arr).end(), 0.)
#define SUMLL(arr) accumulate((arr).begin(), (arr).end(), 0LL)
#define MULD(arr) accumulate((arr).begin(), (arr).end(), 1., multiplies<double>())
#define UB(arr, n) upper_bound((arr).begin(), (arr).end(), n)
#define LB(arr, n) lower_bound((arr).begin(), (arr).end(), n)
#define PB push_back
#define MP make_pair
#define ft first
#define sd second
// input output
//------------------------------------------
#define GL(s) getline(cin, (s))
#define INIT() std::ios::sync_with_stdio(false);std::cin.tie(0)
#define OUT(d) std::cout<<(d)
#define OUT_L(d) std::cout<<(d)<<endl
#define FOUT(n, data) std::cout<<std::fixed<<std::setprecision(n)<<(data)
#define FOUT_L(n, data) std::cout<<std::fixed<<std::setprecision(n)<<(data)<<"\n"
#define EL() printf("\n")
#define SHOW_VECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOW_MAP(v) {std::cerr << #v << endl; for(const auto& xxx: v){std::cerr << xxx.first << " " << xxx.second << "\n";}}
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yay() printf("Yay!\n")
#define Nnn() printf(":(\n")
#define CE(x, y) ((x + y - 1) / (y))
template<typename T1, typename T2>
istream &operator>>(istream &in, pair<T1, T2> &p) {
in >> p.first >> p.second;
return in;
}
template<typename T>
istream &operator>>(istream &in, vector<T> &v) {
for (auto &x: v)
in >> x;
return in;
}
template<typename T1, typename T2>
ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {
out << "[" << p.first << ", " << p.second << "]" << "\n";
return out;
}
template<class T1, class T2>
inline bool chmin(T1 &a, T2 b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T1, class T2>
inline bool chmax(T1 &a, T2 b) {
if (a < b) {
a = b;
return true;
}
return false;
}
//repetition
//------------------------------------------
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) FOR(i,0,n)
#define RREP(i, n) for(int i = n-1;i >= 0;i--)
#define FORLL(i, a, b) for(LL i=LL(a);i<LL(b);++i)
#define RFORLL(i, a, b) for(LL i=LL(b)-1;i>=LL(a);--i)
#define REPLL(i, n) for(LL i=0;i<LL(n);++i)
#define RREPLL(i, n) for(LL i=LL(n)-1;i>=0;--i)
#define FOREACH(x, arr) for(auto &(x) : (arr))
// Option + Control + K Terminal
// Command + Control + K Run
// Command + b EOF
//------------------------------------------
//------------------------------------------
template<typename T>
class CulSum {
private:
long long N;
vector<T> a;
vector<T> aa;
vector<T> b;
vector<T> bb;
function<T(T, T)> func;
public:
/// @param a original array
CulSum(vector<T> _a) {
N = _a.size();
a = _a;
b = _a;
reverse(b.begin(), b.end());
this->aa = vector<T>(N + 1, T{});
this->bb = vector<T>(N + 1, T{});
for (int i = 0; i < N; i++) aa[i + 1] = a[i] + aa[i];
for (int i = 0; i < N; i++) bb[i + 1] = b[i] + bb[i];
}
/// @param a original array
CulSum(vector<T> _a, function<T(T, T)> func) : func(func) {
N = _a.size();
a = _a;
b = _a;
reverse(b.begin(), b.end());
this->aa = vector<T>(N + 1, T{});
this->bb = vector<T>(N + 1, T{});
for (int i = 0; i < N; i++) aa[i + 1] = func(a[i], aa[i]);
for (int i = 0; i < N; i++) bb[i + 1] = func(b[i], bb[i]);
}
/// @brief 0-index original
/// @param l original close
/// @param r original open
T get_sum(int l, int r) {
return aa[r] - aa[l];
}
/// @brief 0-index original
/// @param l original close
/// @param r original open
T get_sum_reverse(int l, int r) {
l = N - l;
r = N - r;
return bb[l] - bb[r];
}
/// @brief 0-index original
/// @param k length
T get_sum_lead_k_len(int k) {
return get_sum(0, k);
}
/// @brief 0-index original
/// @param k length
T get_sum_tail_k_len(int k) {
return get_sum_reverse(N - k, N);
}
void show() {
for (int i = 0; i < N + 1; i++) cout << aa[i] << " ";
cout << endl;
}
void show_reverse() {
for (int i = N; i >= 0; i--) cout << bb[i] << " ";
cout << endl;
}
};
typedef __int128 Lint;
Lint toLint(const string s) {
Lint ret = 0;
for (int i = 0; i < s.length(); i++)
if ('0' <= s[i] && s[i] <= '9')
ret = 10 * ret + s[i] - '0';
return ret;
}
ostream &operator<<(ostream &dest, __int128_t value) {
ostream::sentry s(dest);
if (s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10];
tmp /= 10;
} while (tmp != 0);
if (value < 0) {
--d;
*d = '-';
}
int len = std::end(buffer) - d;
if (dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(ios_base::badbit);
}
}
return dest;
}
istream &operator>>(istream &in, Lint &d) {
string s;
cin >> s;
Lint tmp = 0;
for (int i = 0; i < s.length(); i++)if ('0' <= s[i] && s[i] <= '9')tmp = 10 * tmp + s[i] - '0';
d = tmp;
return in;
}
int main() {
Lint N, K, X, Y;
cin >> N >> K >> X >> Y;
VLL a(N);
cin >> a;
SORT(a);
vector<Lint> A(N);
REP(i, N) A[i] = a[i];
vector<Lint> B(N);
REP(i, N) B[i] = CE(A[i]-1, K);
CulSum<Lint> cul_sum(B);
Lint ans = 0;
for(int i = 0;i<N;i++) ans += B[i];
ans *= X;
for (int i = 0; i < N; i++) {
Lint cost = B[i] * Y;
Lint rem = cul_sum.get_sum(i + 1, N) - (N - i - 1) * B[i];
cost += rem * X;
chmin(ans, cost);
}
// for (int i = 0, j = 0; i < N; i = j) {
// while (j < N and B[i] == B[j])j++;
// LL cost = B[i] * Y;
// LL rem = cul_sum.get_sum(j, N) - (N - j) * B[i];
// cost += rem * X;
// chmin(ans, cost);
// }3 100 10 20
//1 1 1
cout << ans << endl;
}