Submission #214361

---

Source Code Expand

#include <cstdio>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <functional>
#include <limits>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <set>
#include <map>

#define REP(i, a, b) for (int i =a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define pb push_back
#define mp make_pair

using namespace std;

typedef long long ll;

const int INF =100000000;


ll A, C;
int B, D, E;


ll dfs(int n, int h) {
	ll ans;

	if (n == 0) return 0;

	ans =min(dfs(n - 1, h + B) + A, dfs(n - 1, h + D) + C);

	if (h > E) {
		ans =min(ans, dfs(n - 1, h - E));
	}

	return ans;
}

int main() {
	int N, H;

	cin >>N >>H;
	cin >>A >>B >>C >>D >>E;

	if (N > 50) {
		cout <<0 <<endl;
		
		return 0;
	}

	cout <<dfs(N, H) <<endl;

	return 0;
}

Submission Info

Judge Result