Submission #6650553

---

Source Code Expand

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

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

int dfs(int num_rest, int money, int stomach){
  if(stomach < 0) return 1000000;
  if(num_rest == 0) return money;

  return min(dfs(num_rest-1, money+A, stomach+B),
          min(dfs(num_rest-1, money+C, stomach+D), dfs(num_rest-1, money, stomach-E)));

}

int main() {
  //
  cin >> N >> H;
  cin >> A >> B >> C >> D >> E;

  int all_money = dfs(N, 0, H);
  cout << all_money << endl;


  //
//  int all_money = 0, base_money;
//  double efficiency1 = B*1.0/A,
//         efficiency2 = D*1.0/C, interval;
//  if(efficiency1 > efficiency2){
//    interval = 1.0*B / E;
//    base_money = A;
//  }else{
//    interval = 1.0*D / E;
//    base_money = C;
//  }
//
//  //
//  int num_base = floor(N / (interval+1));
//  cout << num_base << " " << N  << " " <<  interval+1  << " " << N / (interval+1) << endl;
//  all_money += base_money * num_base;
//  int num_rest = N - num_base*(interval+1);
//  cout << all_money << endl;
//
//
//  all_money += dfs(num_rest, 0, 0);
//  cout << all_money << endl;

  return 0;
}

Submission Info

Judge Result