Submission #391279

---

Source Code Expand

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

typedef long long ll;

int main() {
  ll N, H, A, B, C, D, E; cin >> N >> H >> A >> B >> C >> D >> E;
  ll minCost = numeric_limits<ll>::max();
  for(ll i = 0; i <= N; ++i) {
    ll now = 0;
    minCost = min(minCost, A*i + C*(N - i));
    for(ll shift = 20; shift >= 0; --shift) {
      ll add = 1 << shift;
      ll k = now + add;
      if(k + i <= N) {
        ll j = N - i - k;
        if(H + B*i + D*j - E*k > 0) {
          now += add;
          minCost = min(minCost, A*i + C*j);
        }
      }
    }
  }
  cout << minCost << endl;
}

Submission Info

Judge Result