結果

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

ソースコード

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

#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
using namespace std;
using ll=long long;
using ld=long double;
using pll=pair<ll,ll>;
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;}
istream& operator >> (istream& is, modint1000000007& x) { unsigned int t; is >> t; x=t; return is; }
istream& operator >> (istream& is, modint998244353& x) { unsigned int t; is >> t; x=t; return is; }
istream& operator >> (istream& is, modint& x) { unsigned int t; is >> t; x=t; return is; }
ostream& operator << (ostream& os, const modint1000000007& x) { os << x.val(); return os; }
ostream& operator << (ostream& os, const modint998244353& x) { os << x.val(); return os; }
ostream& operator << (ostream& os, const modint& x) { os << x.val(); return os; }
template<class T1, class T2>istream& operator >> (istream& is, pair<T1,T2>& p) { is >> p.first >> p.second; return is; }
template<class T1, class T2>ostream& operator << (ostream& os, const pair<T1,T2>& p) { os << p.first << " " << p.second; return os;}
template<class T>istream& operator >> (istream& is, vector<T>& v) { for(T& x:v) is >> x; return is; }
template<class T>ostream& operator << (ostream& os, const vector<T>& v) {for(int i=0;i<v.size();i++) {os << v[i] << (i+1 == v.size() ? "":" ");} 
    return os;}
template<class... A> void pt()      { std::cout << "\n"; }
template<class... A> void pt_rest() { std::cout << "\n"; }
template<class T, class... A> void pt_rest(const T& first, const A&... rest) { std::cout << " " << first; pt_rest(rest...); }
template<class T, class... A> void pt(const T& first, const A&... rest)      { std::cout << first; pt_rest(rest...); }
static const ll INF=1e18+7;
static const double PI=acos(-1);
static const double EPS=1e-10;
using v1=vector<ll>;
using v2=vector<v1>;
using v3=vector<v2>;
int main(void) {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  
  ll N,A,B,X,Y;cin>>N>>A>>B>>X>>Y;
  v1 H(N);cin>>H;
  
  auto ok=[&](ll K,v1 h){
    for(ll i=0;i<N;i++)h[i]-=min(h[i],K);
    ll rem=A;
    for(ll i=0;i<N;i++){
      ll t=min(rem,h[i]/X);
      h[i]-=min(h[i],t*X);
      rem-=t;
    }
    sort(rall(h));
    
    for(ll i=0;i<N;i++){
      if(rem==0)break;
      h[i]=0;
      rem--;
    }
    
    ll s=accumulate(all(h),0LL);
    return s<=Y*B;
    
  };
  
  ll l=-1,r=INF;
  while(l+1<r){
    ll m=(l+r)/2;
    (ok(m,H)?r:l)=m;
  }
  pt(r);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0