結果

問題 No.1739 Princess vs. Dragoness (& AoE)
ユーザー 👑 deuteridayodeuteridayo
提出日時 2021-11-19 15:39:07
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 2,795 bytes
コンパイル時間 4,607 ms
コンパイル使用メモリ 234,152 KB
実行使用メモリ 5,180 KB
最終ジャッジ日時 2023-08-29 23:05:28
合計ジャッジ時間 13,052 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,384 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 AC 128 ms
4,884 KB
testcase_07 AC 2 ms
4,380 KB
testcase_08 AC 165 ms
4,408 KB
testcase_09 AC 225 ms
4,880 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 10 ms
4,384 KB
testcase_13 AC 185 ms
4,608 KB
testcase_14 WA -
testcase_15 AC 284 ms
4,956 KB
testcase_16 WA -
testcase_17 AC 139 ms
4,380 KB
testcase_18 WA -
testcase_19 AC 82 ms
4,380 KB
testcase_20 AC 62 ms
4,380 KB
testcase_21 AC 185 ms
4,640 KB
testcase_22 AC 252 ms
4,692 KB
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 297 ms
5,100 KB
testcase_27 WA -
testcase_28 AC 299 ms
4,876 KB
testcase_29 WA -
testcase_30 WA -
testcase_31 AC 295 ms
4,972 KB
testcase_32 AC 297 ms
4,876 KB
testcase_33 AC 2 ms
4,384 KB
testcase_34 AC 2 ms
4,380 KB
testcase_35 AC 2 ms
4,384 KB
testcase_36 AC 2 ms
4,384 KB
testcase_37 AC 2 ms
4,380 KB
testcase_38 AC 2 ms
4,380 KB
testcase_39 AC 3 ms
4,384 KB
testcase_40 AC 2 ms
4,380 KB
testcase_41 AC 2 ms
4,380 KB
testcase_42 AC 2 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using lint = long long;
using ulint = unsigned long long;
#define endl '\n'
int const INF = 1<<30;
lint const INF64 = 1LL<<61;
// lint const mod = 1e9+7;
long const mod = 998244353;
lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}}
lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}}
lint Sqrt(lint x){lint upper = 1e9;lint lower = 0;while(upper - lower > 0){lint mid = (1+upper + lower)/2;if(mid * mid > x){upper = mid-1;}else{lower = mid;}}return upper;}
lint gcd(lint a,lint b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}
lint lcm(lint a,lint b){return (a / gcd(a,b)) * b;}
lint chmin(vector<lint>&v){lint ans = INF64;for(lint i:v){ans = min(ans, i);}return ans;}
lint chmax(vector<lint>&v){lint ans = -INF64;for(lint i:v){ans = max(ans, i);}return ans;}
double dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));}
string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c + ans;}}return ans;}
string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;}
vector<lint>prime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j<prime.size() && prime[j]*prime[j] <= i;j++){if(i % prime[j]==0){chk=false;break;}}if(chk)prime.push_back(i);}}
lint kai[20000001]; bool firstCallnCr = true; 
lint ncrmodp(lint n,lint r,lint p){ if(firstCallnCr){ kai[0] = 1; for(int i=1;i<=20000000;i++){ kai[i] = kai[i-1] * i; kai[i] %= mod;} firstCallnCr = false;} if(n<0)return 0;
if(n < r)return 0;if(n==0)return 1;lint ans = kai[n];lint tmp = (kai[r] * kai[n-r]) % p;for(lint i=1;i<=p-2;i*=2){if(i & p-2){ans *= tmp;ans %= p;}tmp *= tmp;tmp %= p;}return ans;}

struct edge{
    int to;
};
using graph = vector<vector<edge>>;

int main(){ 
    lint n,a,b,x,y;
    cin >> n >> a >> b >> x >> y;
    lint h[n];
    for(int i = 0;i<n;i++) {
        cin >> h[i];
    }
    lint ac = 1e18;
    lint wa = -1;
    while(ac - wa > 1) {
        lint k = (ac + wa) / 2;
        cerr << k << endl;
        vector<lint>H(n);
        for(int i = 0;i<n;i++) {
            H[i] = max(0LL, h[i] - k);
        }
        lint summ = 0;
        sort(H.rbegin(), H.rend());
        int acount = a;
        for(int i = 0;i<n;i++) {
            if(acount > 0){
                H[i] -= x;
                acount--;
            }
            if(H[i] > 0)summ += H[i];
            
        }
        if(summ > b * y) {
            wa = k ;
        } else {
            ac = k;
        }
    }
    cout << ac << endl;
}
0