Submission #7470468

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n-1);i>=0;i--)
#define FOR(i,n,m) for(int i=n;i<=(int)(m);i++)
#define RFOR(i,n,m) for(int i=(int)(n);i>=m;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) int(x.size())
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using namespace std;
int main(){
    ll n,h,a,b,c,d,e;
    cin>>n>>h>>a>>b>>c>>d>>e;
    
    ll ans=LINF;
    FOR(i,0,n){ //食事抜きで乗り切る日数
        ll x=(ll)i*e-h;
        ll m=n-i;
        
        ll ng = -1, ok = m+1;
        while (ok - ng > 1) {
            int mid = (ng + ok) / 2;
            bool f=((ll)b*mid+d*(m-mid)>x);
            (f ? ok : ng) = mid;
        }
        if(ok==m+1) continue;
        ans=min(ans,(ll)ok*a+(m-ok)*c);
    }
    cout<<ans<<endl;
}

Submission Info

Judge Result