結果

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

ソースコード

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

#include<bits/stdc++.h>
typedef uint64_t u64;
typedef int64_t i64;
using namespace std;
void solve();
int main(){
  cout<<fixed<<setprecision(0);
  bool is_multicase=false;
  int T=1;
  if(is_multicase){
    cin>>T;
  }
  for(int i=0;i<T;++i){
    solve();
  }
  return 0;
}
template<typename T> void turtle_in(T& n){
  cin>>n;
}
template<typename T,typename U> void turtle_in(pair<T,U>& p){
  turtle_in(p.first);
  turtle_in(p.second);
}
template<typename T> void turtle_in(vector<T>& v){
  for(auto& u:v){
    turtle_in(u);
  }
}
template<typename T> void turtle_out(T& n){
  cout<<n;
}
template<typename T,typename U> void turtle_out(pair<T,U>& p){
  cout<<"{";
  turtle_out(p.first);
  cout<<", ";
  turtle_out(p.second);
  cout<<"}";
}
template<typename T> void turtle_out(vector<T>& v){
  for(int i=0;i<int(v.size());++i){
    turtle_out(v[i]);
    if(i!=v.size()-1){
      cout<<" ";
    }
  }
  cout<<endl;
}
template<typename T> void turtle_out(vector<vector<T>>& v){
  for(int i=0;i<int(v.size());++i){
    turtle_out(v[i]);
  }
}
void scan(){}
template<typename T,class... Args> void scan(T& n,Args&... args){
  turtle_in(n);
  scan(args...);
}
void print(){}
template<typename T,class... Args> void print(T n,Args... args){
  turtle_out(n);
  print(args...);
}
template<typename T> void println(T n){
  turtle_out(n);
  cout<<endl;
}
template<typename T,class... Args> void println(T n,Args... args){
  turtle_out(n);
  cout<<" ";
  println(args...);
}
template<u64 mod> struct modint{
  u64 val;
  modint(i64 val_=0):val((val_%i64(mod)+i64(mod))%i64(mod)){}
  modint operator-(){
    return modint(mod-val);
  }
  modint operator+(modint rhs){
    return modint(*this)+=rhs;
  }
  modint operator-(modint rhs){
    return modint(*this)-=rhs;
  }
  modint operator*(modint rhs){
    return modint(*this)*=rhs;
  }
  modint operator/(modint rhs){
    return modint(*this)/=rhs;
  }
  modint &operator+=(modint rhs){
    val+=rhs.val;
    val-=((val>=mod)?mod:0);
    return (*this);
  }
  modint &operator-=(modint rhs){
    val+=((val<rhs.val)?mod:0);
    val-=rhs.val;
    return (*this);
  }
  modint &operator*=(modint rhs){
    val=val*rhs.val%mod;
    return (*this);
  }
  modint &operator/=(modint rhs){
    u64 ex=mod-2;
    modint now=1;
    while(ex){
      now*=((ex&1)?rhs:1);
      rhs*=rhs,ex>>=1;
    }
    return (*this)*=now;
  }
  bool operator==(modint rhs){
    return val==rhs.val;
  }
  bool operator!=(modint rhs){
    return val!=rhs.val;
  }
  friend std::ostream &operator<<(std::ostream& os,modint x){
    return os<<(x.val);
  }
  friend std::istream &operator>>(std::istream& is,modint& x){
    u64 t;
    is>>t,x=t;
    return is;
  }
};
template<typename T,typename U> T power(T a,U n){
  T res=1;
  while(n>0){
    if(n%2==1){
      res*=a;
    }
    a*=a;
    n/=2;
  }
  return res;
}
template<typename T> struct genrand{
  uniform_int_distribution<T> gen;
  mt19937 engine;
  genrand(T a,T b):gen(a,b){
    random_device seed_gen;
    engine.seed(seed_gen());
  }
  T operator()(){
    return gen(engine);
  }
};
template<typename T> struct comb{
  vector<T> dat,idat;
  comb(int mx=3000000):dat(mx+1,1),idat(mx+1,1){
    for(int i=1;i<=mx;++i){
      dat[i]=dat[i-1]*i;
    }
    idat[mx]/=dat[mx];
    for(int i=mx;i>0;--i){
      idat[i-1]=idat[i]*i;
    }
  }
  T operator()(int n,int k){
    if(n<0||k<0||n<k){
      return 0;
    }
    return dat[n]*idat[k]*idat[n-k];
  }
};
bool sub(i64 N,i64 A,i64 B,i64 X,i64 Y,vector<i64> H,i64 x){
    for(int i=0;i<N;++i){
        H[i]-=x;
    }
    multiset<i64> T;
    for(int i=0;i<N;++i){
        T.insert(H[i]);
    }
    while(A--){
        i64 v=(*prev(T.end()));
        T.erase(prev(T.end()));
        T.insert(v-X);
    }
    i64 sum=0;
    for(auto v:T){
        sum+=max(i64(0),v);
    }
    return sum<=B*Y;
}
void solve(){
  i64 N,A,B,X,Y;
  scan(N,A,B,X,Y);
  vector<i64> H(N);
  scan(H);
  /*i64 ok=0,ng=1e9+5;
  while(1<std::abs(ok-ng)){
      i64 mid=(ok+ng)/2;
      bool f=sub(N,A,B,X,Y,H,mid);
      if(f){
          ok=mid;
      }
      else{
          ng=mid;
      }
  }*/
  println(sub(N,A,B,X,Y,H,0)?"Yes":"No");
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0