結果
問題 | No.1739 Princess vs. Dragoness (& AoE) |
ユーザー | eQe |
提出日時 | 2021-11-12 22:59:33 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 382 ms / 3,000 ms |
コード長 | 2,567 bytes |
コンパイル時間 | 4,644 ms |
コンパイル使用メモリ | 264,728 KB |
実行使用メモリ | 4,744 KB |
最終ジャッジ日時 | 2023-08-17 03:26:54 |
合計ジャッジ時間 | 14,322 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 2 ms
4,376 KB |
testcase_04 | AC | 353 ms
4,708 KB |
testcase_05 | AC | 382 ms
4,728 KB |
testcase_06 | AC | 196 ms
4,616 KB |
testcase_07 | AC | 2 ms
4,376 KB |
testcase_08 | AC | 205 ms
4,380 KB |
testcase_09 | AC | 289 ms
4,424 KB |
testcase_10 | AC | 117 ms
4,380 KB |
testcase_11 | AC | 100 ms
4,376 KB |
testcase_12 | AC | 15 ms
4,380 KB |
testcase_13 | AC | 230 ms
4,380 KB |
testcase_14 | AC | 270 ms
4,376 KB |
testcase_15 | AC | 361 ms
4,744 KB |
testcase_16 | AC | 97 ms
4,376 KB |
testcase_17 | AC | 176 ms
4,376 KB |
testcase_18 | AC | 148 ms
4,376 KB |
testcase_19 | AC | 114 ms
4,376 KB |
testcase_20 | AC | 77 ms
4,380 KB |
testcase_21 | AC | 246 ms
4,456 KB |
testcase_22 | AC | 320 ms
4,380 KB |
testcase_23 | AC | 375 ms
4,560 KB |
testcase_24 | AC | 379 ms
4,564 KB |
testcase_25 | AC | 345 ms
4,564 KB |
testcase_26 | AC | 377 ms
4,544 KB |
testcase_27 | AC | 368 ms
4,604 KB |
testcase_28 | AC | 375 ms
4,616 KB |
testcase_29 | AC | 369 ms
4,724 KB |
testcase_30 | AC | 362 ms
4,672 KB |
testcase_31 | AC | 377 ms
4,720 KB |
testcase_32 | AC | 365 ms
4,564 KB |
testcase_33 | AC | 1 ms
4,380 KB |
testcase_34 | AC | 2 ms
4,376 KB |
testcase_35 | AC | 2 ms
4,380 KB |
testcase_36 | AC | 1 ms
4,380 KB |
testcase_37 | AC | 1 ms
4,376 KB |
testcase_38 | AC | 2 ms
4,380 KB |
testcase_39 | AC | 4 ms
4,376 KB |
testcase_40 | AC | 2 ms
4,376 KB |
testcase_41 | AC | 3 ms
4,380 KB |
testcase_42 | AC | 3 ms
4,376 KB |
ソースコード
#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); }