結果

問題 No.1739 Princess vs. Dragoness (& AoE)
ユーザー LayCurse
提出日時 2021-11-12 21:30:01
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 252 ms / 3,000 ms
コード長 4,797 bytes
コンパイル時間 2,516 ms
コンパイル使用メモリ 223,464 KB
最終ジャッジ日時 2025-01-25 15:50:23
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 40
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("inline")
#include<bits/stdc++.h>
using namespace std;
template<class T> struct cLtraits_identity{
  using type = T;
}
;
template<class T> using cLtraits_try_make_signed =
  typename conditional<
    is_integral<T>::value,
    make_signed<T>,
    cLtraits_identity<T>
    >::type;
template <class S, class T> struct cLtraits_common_type{
  using tS = typename cLtraits_try_make_signed<S>::type;
  using tT = typename cLtraits_try_make_signed<T>::type;
  using type = typename common_type<tS,tT>::type;
}
;
void*wmem;
char memarr[96000000];
template<class S, class T> inline auto min_L(S a, T b)
-> typename cLtraits_common_type<S,T>::type{
  return (typename cLtraits_common_type<S,T>::type) a <= (typename cLtraits_common_type<S,T>::type) b ? a : b;
}
template<class S, class T> inline auto max_L(S a, T b)
-> typename cLtraits_common_type<S,T>::type{
  return (typename cLtraits_common_type<S,T>::type) a >= (typename cLtraits_common_type<S,T>::type) b ? a : b;
}
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 T> inline void walloc1d(T **arr, int x1, int x2, void **mem = &wmem){
  walloc1d(arr, x2-x1, mem);
  (*arr) -= x1;
}
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');
  }
}
int main(){
  wmem = memarr;
  long long N;
  rd(N);
  long long A;
  rd(A);
  long long B;
  rd(B);
  long long X;
  rd(X);
  long long Y;
  rd(Y);
  long long H[N];
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){
      rd(H[Lj4PdHRW]);
    }
  }
  long long k;
  long long res;
  long long chk[N];
  long long rem;
  long long e98WHCEY;
  long long cTE1_r3A;
  long long RZTsC2BF;
  e98WHCEY = 0;
  cTE1_r3A = 1000000000;
  while(e98WHCEY < cTE1_r3A){
    int i;
    if((e98WHCEY + cTE1_r3A)%2==0){
      RZTsC2BF = (e98WHCEY + cTE1_r3A) / 2;
    }
    else{
      RZTsC2BF = (e98WHCEY + cTE1_r3A - 1) / 2;
    }
    for(i=(0);i<(N);i++){
      chk[i] =max_L(0, H[i]-RZTsC2BF);
    }
    rem = A;
    for(i=(0);i<(N);i++){
      k =min_L(chk[i] / X, rem);
      auto hCmBdyQB = ((1)* k);
      auto V9aVTaxx = (( X)* k);
      rem-=hCmBdyQB;
      chk[i]-=V9aVTaxx;
    }
    sortA_L(N,chk);
    for(i=(N)-1;i>=(0);i--){
      if(rem > 0){
        rem--;
        chk[i] = 0;
      }
    }
    int jZyWAPpY;
    cLtraits_try_make_signed<remove_reference<decltype((*((long long*)NULL)))>::type>::type jbtyPBGc;
    if(N==0){
      jbtyPBGc = 0;
    }
    else{
      jbtyPBGc = chk[0];
      for(jZyWAPpY=(1);jZyWAPpY<(N);jZyWAPpY++){
        jbtyPBGc += chk[jZyWAPpY];
      }
    }
    k =jbtyPBGc;
    if(k <= B*Y){
      cTE1_r3A = RZTsC2BF;
    }
    else{
      e98WHCEY = RZTsC2BF + 1;
    }
  }
  res =cTE1_r3A;
  wt_L(res);
  wt_L('\n');
  return 0;
}
// cLay version 20211024-1
// --- original code ---
// ll @N, @A, @B, @X, @Y, @H[N], k, res;
// ll chk[N], rem;
// 
// res = bsearch_min[ll,x,0,1d9][
//   rep(i,N) chk[i] = max(0, H[i]-x);
//   rem = A;
//   rep(i,N){
//     k = min(chk[i] / X, rem);
//     (rem, chk[i]) -= (1, X) * k;
//   }
//   sortA(N,chk);
//   rrep(i,N) if(rem > 0) rem--, chk[i] = 0;
//   k = sum(chk(N));
// ](k <= B*Y);
// wt(res);
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0