Submission #1305045

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define first  fs
#define second se
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)

using pii = pair<int, int>;
using vi = vector<int>;
using lint = long long;

const int inf = 1001001001;
const lint linf = 1001001001001001001ll;
const int mod = 1e9 + 7;
const int dx[]{0, 1, 0, -1, -1, -1, 1, 1}, dy[]{1, 0, -1, 0, -1, 1, -1, 1};

template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; } return a > b; }
template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; } return a < b; }
template<typename T> inline void print(const T &x, char s = '\n') { cout << x << s; }
template<typename T> inline void print(const vector<T> &v, string s = " ") 
{ rep(i, v.size()) cout << v[i] << (i + 1 == v.size() ? "\n" : s); }
inline bool inside(int y, int x, int H, int W) { return 0 <= y && y < H && 0 <= x && x < W; }
inline lint in() { lint x; std::cin>>x; return x; }

int main() {
	lint n = in(), h = in();
	lint a = in(), b = in(), c = in(), d = in(), e = in();

	lint ans = linf;
	for (int i = 0; i <= n; ++i) {
		lint j = ((n - i) * e - i * b - h + d + e - 1) / (d + e);
		if (j < 0) j = 0;

		lint v = i * a + j * c;
//		if (h + i * b + j * d - (n - i - j) * e <= 0) v += c;

		chmin(ans, v);
//		cout << i << " " << j << " " << v << endl;
	}

	cout << ans << endl;
}

Submission Info

Judge Result