Submission #1444660

---

Source Code Expand

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

ll n, h, a, b, c, d, e;

int main(int argc, char **argv) {
	cin >> n >> h >> a >> b >> c >> d >> e;
	ll res = n * a;
	REP(x, n) {
		ll l = -1, hi = n - x;
		while (l + 1 < hi) {
			ll m = (l + hi) / 2;
			ll z = n - x - m;
			if (h + b * x + d * m - e * z > 0) hi = m;
			else l = m;
		}
		res = min(res, a * x + c * hi);
	}
	cout << res << endl;
	return 0;
}

Submission Info

Judge Result