Submission #214152

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <cassert>
#include <iomanip>
using namespace std;
typedef long long ll;
static const double EPS = 1e-9;
static const int mod = 1000000007;

ll N,H,A,B,C,D,E;

ll minLL(ll a,ll b){
	return a>b?b:a;
}

int main() {
	// freopen ("input.txt", "r", stdin);
	// freopen ("output.txt", "w", stdout);
	while(cin>>N>>H>>A>>B>>C>>D>>E){
		if(H>=E*N){
			cout<<0<<endl;
			continue;
		}
		ll res=0xffffffffffffLL;
		ll low=0,high=0xfffffff;
		while(high-low>1){
			ll mid=(high+low)/2;
			if(H+mid*B>E*(N-mid))high=mid;
			else low=mid;
		}
		ll an=high;
		low=0;high=0xfffffff;
		while(high-low>1){
			ll mid=(high+low)/2;
			if(H+mid*D>E*(N-mid))high=mid;
			else low=mid;
		}
		ll cn=high;

		res=minLL(res,A*an);
		res=minLL(res,C*cn);
		for(ll i=1;i<an;i++){
			low=0;high=0xfffffff;
			while(high-low>1){
				ll mid=(high+low)/2;
				if(H+B*i+mid*D>E*(N-mid-i))high=mid;
				else low=mid;
			}
			res=minLL(res,A*i+C*high);
		}
		cout<<res<<endl;
	}
}

Submission Info

Judge Result