#715225 (C++14) No.1739 Princess vs. Dragoness (& AoE)

• 問題: No.1739 Princess vs. Dragoness (& AoE)
• ユーザー: auaua
• 提出日時: 2021-11-12 21:45:09
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 354 ms / 3,000 ms
• コード長: 1,912 bytes
• コンパイル時間: 1,556 ms
• コンパイル使用メモリ: 174,144 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-25 17:47:32
• 合計ジャッジ時間: 8,087 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

ファイルパターン	結果
sample	AC * 3
other	AC * 40

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
//#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=MOD;
const ll MAX=100010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;
void solve(){
    ll n;cin>>n;
    ll a,b,x,y;cin>>a>>b>>x>>y;
    vector<ll>z(n);
    rep(i,n)cin>>z[i];
    {
        ll mid=0;
        vector<ll>h(n);
    rep(i,n)h[i]=z[i];
    rep(i,n)h[i]=max(0LL,h[i]-mid);
    ll cnt=0;
    ll sum=0;
    rep(j,n){
        cnt+=h[j]/x;
        h[j]%=x;
        sum+=h[j];
    }
    ll aa=a;
    ll d=min(cnt,aa);
    cnt-=d,aa-=d;
    sum+=cnt*x;
    sort(rall(h));
    rep(i,n){
        if(aa){
            aa--;
            sum-=h[i];
        }
    }
    if(b*y>=sum){
        cout<<0<<endl;
        return;
    }
    }
    ll l=0,r=inf;
    ll s=0;
    while(r-l>1){
        s++;
        ll mid=(r+l)/2;
        vector<ll>h(n);
    rep(i,n)h[i]=z[i];
    rep(i,n)h[i]=max(0LL,h[i]-mid);
    ll cnt=0;
    ll sum=0;
    rep(j,n){
        cnt+=h[j]/x;
        h[j]%=x;
        sum+=h[j];
    }
    ll aa=a;
    ll d=min(cnt,aa);
    cnt-=d,aa-=d;
    sum+=cnt*x;
    sort(rall(h));
    rep(i,n){
        if(aa){
            aa--;
            sum-=h[i];
        }
    }
    if(b*y>=sum){
        r=mid;
    }else{
        l=mid;
    }
    }
    cout<<r<<endl;
}
signed main(){
    //cin.tie(0);
    //ios::sync_with_stdio(false);
    solve();
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX