Submission #1679675

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <list>
#include <utility>
#include <ctime>
#define INF 1000000000
#define LINF 9000000000000000000
#define mod 1000000007
 
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rrep(i,n) for(int i=(n);i>=0;i--)
#define REP(i,a,b) for(int i=(a);i<int(b);i++)
#define all(x) (x).begin(),x.end()
#define vector_rsort(x) sort(all(x));reverse(all(x))
#define array_rsort(x,n) sort(x,x+n);reverse(x,x+n);
#define pb push_back
#define mp make_pair
#define MOD(x) (x%(mod))

#define yes cout<<"yes"<<endl;
#define no cout<<"no"<<endl;
#define Yes cout<<"Yes"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define NO cout<<"NO"<<endl
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
 
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
bool debug=false;
/*---------------------------------------------------*/

ll a,b,c,d,e;
ll cost=0;

int dfs(int cost,int h,int day){
  if(day==0){
    //cout<<cost<<" "<<h<<endl;
    return cost;
  }else{
    if(0<=h-e)return dfs(cost,h-e,day-1);
    else return min(dfs(cost+a,h+b,day-1),dfs(cost+c,h+d,day-1));
  }
}

int main(){
  ll n,h;
  cin>>n>>h;
  cin>>a>>b>>c>>d>>e;
  cout<<dfs(0,h,n)<<endl;
  return 0;
}

Submission Info

Judge Result