結果
問題 | No.1071 ベホマラー |
ユーザー |
![]() |
提出日時 | 2020-06-05 21:24:31 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 17 ms / 2,000 ms |
コード長 | 3,050 bytes |
コンパイル時間 | 2,932 ms |
コンパイル使用メモリ | 213,172 KB |
最終ジャッジ日時 | 2025-01-10 22:02:59 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 5 |
other | AC * 20 |
ソースコード
#pragma GCC optimize ("Ofast")#include<bits/stdc++.h>using namespace std;void *wmem;char memarr[96000000];template<class T> inline void walloc1d(T **arr, int x, void **mem = &wmem){static int skip[16] = {0, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1};(*mem) = (void*)( ((char*)(*mem)) + skip[((unsigned long long)(*mem)) & 15] );(*arr)=(T*)(*mem);(*mem)=((*arr)+x);}template<class T1> void sortA_L(int N, T1 a[], void *mem = wmem){sort(a, a+N);}inline int my_getchar_unlocked(){static char buf[1048576];static int s = 1048576;static int e = 1048576;if(s == e && e == 1048576){e = fread_unlocked(buf, 1, 1048576, stdin);s = 0;}if(s == e){return EOF;}return buf[s++];}inline void rd(long long &x){int k;int m=0;x=0;for(;;){k = my_getchar_unlocked();if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){x=k-'0';break;}}for(;;){k = my_getchar_unlocked();if(k<'0'||k>'9'){break;}x=x*10+k-'0';}if(m){x=-x;}}struct MY_WRITER{char buf[1048576];int s;int e;MY_WRITER(){s = 0;e = 1048576;}~MY_WRITER(){if(s){fwrite_unlocked(buf, 1, s, stdout);}}};MY_WRITER MY_WRITER_VAR;void my_putchar_unlocked(int a){if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);MY_WRITER_VAR.s = 0;}MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;}inline void wt_L(char a){my_putchar_unlocked(a);}inline void wt_L(long long x){int s=0;int m=0;char f[20];if(x<0){m=1;x=-x;}while(x){f[s++]=x%10;x/=10;}if(!s){f[s++]=0;}if(m){my_putchar_unlocked('-');}while(s--){my_putchar_unlocked(f[s]+'0');}}template<class S, class T> inline S divup_L(S a, T b){return (a+b-1)/b;}template<class S, class T> inline S chmin(S &a, T b){if(a>b){a=b;}return a;}long long N;long long K;long long X;long long Y;long long A[100000+1];int main(){int i;wmem = memarr;long long res = 4611686016279904256LL;long long sm = 0;rd(N);rd(K);rd(X);rd(Y);{int Lj4PdHRW;for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){rd(A[Lj4PdHRW]);}}for(i=(0);i<(N);i++){A[i] =(divup_L((A[i]-1),K));}A[N++] = 0;sortA_L(N,A);for(i=(N)-1;i>=(0);i--){if((double)X * (sm - A[i] * (N-i-1)) + (double)Y * A[i] < 4611686016279904256LL){chmin(res, X * (sm - A[i] * (N-i-1)) + Y * A[i]);}sm += A[i];}wt_L(res);wt_L('\n');return 0;}// cLay varsion 20200509-1// --- original code ---// ll N, K, X, Y, A[1d5+1];// {// ll res = ll_inf, sm = 0;// rd(N,K,X,Y,A(N));// rep(i,N) A[i] = (A[i]-1) /+ K;// A[N++] = 0;// sortA(N,A);//// rrep(i,N){// if((double)X * (sm - A[i] * (N-i-1)) + (double)Y * A[i] < ll_inf){// res <?= X * (sm - A[i] * (N-i-1)) + Y * A[i];// }// sm += A[i];// }// wt(res);// }