Submission #215006

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

typedef long long LL;

int main()
{
	int n, h;
	cin >> n >> h;
	int a, b, c, d, e;
	cin >> a >> b >> c >> d >> e;

	int a1[3] = { a, c, 0 };
	int a2[3] = { b, d, e };
	LL m = 0x3f3f3f3f3f3f3f3fLL;
	//vector<vector<LL>> dp(n + 1, vector<LL>(n + 1));
	//vector<LL> dp(n + 1);
	for (LL i = 0; i <= n; ++i)
	{
		/*for (int j = 0; j <= n - i; ++j)
		{
			if (h + b*i + d*j - (n - i - j)*e > 0)
			{
				dp[i][j] = i*a + j*c;
				m = min(dp[i][j], m);
			}
		}*/
		LL j = ((n - i)*e - h - b*i);
		if (j < 0)
			j = 0;
		else
			j = j / (d + e) + 1;
		m = min(i*a + j*c, m);
	}
	cout << m << endl;
	return 0;
}

Submission Info

Judge Result