結果
問題 | No.1739 Princess vs. Dragoness (& AoE) |
ユーザー | suta28407928 |
提出日時 | 2021-11-12 21:38:21 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,048 bytes |
コンパイル時間 | 2,123 ms |
コンパイル使用メモリ | 187,696 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-11-25 17:30:21 |
合計ジャッジ時間 | 9,717 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,820 KB |
testcase_01 | AC | 1 ms
6,820 KB |
testcase_02 | AC | 2 ms
6,816 KB |
testcase_03 | WA | - |
testcase_04 | AC | 292 ms
6,820 KB |
testcase_05 | AC | 290 ms
6,816 KB |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | AC | 162 ms
6,816 KB |
testcase_09 | AC | 254 ms
6,820 KB |
testcase_10 | AC | 107 ms
6,816 KB |
testcase_11 | WA | - |
testcase_12 | AC | 18 ms
6,820 KB |
testcase_13 | WA | - |
testcase_14 | AC | 194 ms
6,816 KB |
testcase_15 | AC | 281 ms
6,820 KB |
testcase_16 | AC | 77 ms
6,820 KB |
testcase_17 | AC | 133 ms
6,820 KB |
testcase_18 | AC | 137 ms
6,820 KB |
testcase_19 | AC | 133 ms
6,816 KB |
testcase_20 | WA | - |
testcase_21 | AC | 223 ms
6,816 KB |
testcase_22 | AC | 258 ms
6,820 KB |
testcase_23 | AC | 282 ms
6,816 KB |
testcase_24 | AC | 302 ms
6,816 KB |
testcase_25 | AC | 296 ms
6,820 KB |
testcase_26 | WA | - |
testcase_27 | AC | 292 ms
6,816 KB |
testcase_28 | WA | - |
testcase_29 | AC | 285 ms
6,816 KB |
testcase_30 | AC | 289 ms
6,820 KB |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | AC | 2 ms
6,820 KB |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | AC | 3 ms
6,820 KB |
testcase_39 | AC | 3 ms
6,820 KB |
testcase_40 | AC | 2 ms
6,820 KB |
testcase_41 | AC | 3 ms
6,820 KB |
testcase_42 | AC | 2 ms
6,816 KB |
ソースコード
#pragma GCC ta g("avx2")#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>using namespace std;#define DEBUG#ifdef DEBUGtemplate <class T, class U>ostream &operator<<(ostream &os, const pair<T, U> &p) {os << '(' << p.first << ',' << p.second << ')';return os;}template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {os << '{';for(int i = 0; i < (int)v.size(); i++) {if(i) { os << ','; }os << v[i];}os << '}';return os;}void debugg() { cerr << endl; }template <class T, class... Args>void debugg(const T &x, const Args &... args) {cerr << " " << x;debugg(args...);}#define debug(...) \cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl#else#define debug(...) (void(0))#define dump(x) (void(0))#endifusing namespace std;typedef long long ll;typedef vector<ll> vl;typedef vector<vl> vvl;typedef vector<char> vc;typedef vector<string> vs;typedef vector<bool> vb;typedef vector<double> vd;typedef pair<ll,ll> P;typedef pair<int,int> pii;typedef vector<P> vpl;typedef tuple<ll,ll,ll> tapu;#define rep(i,n) for(int i=0; i<(n); i++)#define REP(i,a,b) for(int i=(a); i<(b); i++)#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){if(a>b){a = b; return true;}else return false;}template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){if(a<b){a = b; return true;}else return false;}template<typename T> inline void print(T &a){int sz = a.size();for(auto itr = a.begin(); itr != a.end(); itr++){cout << *itr;sz--;if(sz) cout << " ";}cout << "\n";}template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){cout << a << " " << b << " " << c << "\n";}void mark() {cout << "#" << "\n";}ll pcount(ll x) {return __builtin_popcountll(x);}//#include <atcoder/maxflow>//using namespace atcoder;const int inf = (1<<30)-1;const ll linf = 1LL<<61;const int MAX = 510000;int dy[8] = {0,1,0,-1,1,-1,-1,1};int dx[8] = {-1,0,1,0,1,-1,1,-1};const double pi = acos(-1);const double eps = 1e-9;//const int mod = 1e9 + 7;const int mod = 998244353;int main(){ll n,A,B,x,y; cin >> n >> A >> B >> x >> y;vl H(n); rep(i,n) cin >> H[i];vl h(n);ll ok = 1e9, ng = 0;while(ok-ng > 1){ll mid = (ok+ng) / 2;h.resize(n);rep(i,n) h[i] = H[i] - mid;ll a = A, b = B;rep(i,n){if(h[i] < 0) continue;ll q = min(h[i]/x,a);h[i] -= q*x;a -= q;}sort(all(h));while(a > 0 && !h.empty()){h.pop_back(); a--;}ll s = 0;for(auto p : h) s += max(0LL,p);if(h.empty() || s <= b*y) ok = mid;else ng = mid;}cout << ok << endl;}