Submission #213888

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<cmath>
#include<functional>
#include<algorithm>
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;


int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	long long n,h;
	long long a,b,c,d,e;
	cin>>n>>h;
	cin>>a>>b>>c>>d>>e;
	long long ans=1LL<<60;
	for(int i=0;i<=n;i++){
		long long hara=h+i*b;
		long long kane=i*a;
		long long lb=-1,ub=n-i;
		while(ub-lb>1){
			long long mid=(lb+ub)/2;
			if(hara+mid*d-(n-i-mid)*e>0){
				ub=mid;
			}else{
				lb=mid;
			}
		}
		ans=min(ans,kane+ub*c);
	}
	cout<<ans<<endl;

	return 0;
}

Submission Info

Judge Result