Submission #1367871

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define rrep(i,n) for(int i=(int)(n)-1; i>=0; i--)
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin(); it!=(c).end(); it++)
#define pb(a) push_back(a)
#define pr(a) cout << (a) << endl
#define PR(a,b) cout << (a) << " " << (b) << endl
#define F first
#define S second
typedef long long ll;
typedef pair<int,int> P;
const int MAX=1000000001;
const ll MAXL=1000000000000000001LL;
const ll mod=1000000007;
int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};
 
int main() {
  ll n,d;
  cin >> n >> d;
  ll a,a2,b,b2,k;
  cin >> a >> a2 >> b >> b2 >> k;
  ll ans=MAXL;
  rep(i,n+1) {
    ll dd=d+a2*(ll)i;
    ll l=-1,r=2*n,m;
    while(l+1!=r) {
      m=(l+r)/2;
      if(dd+m*b2-k*(n-(ll)i-m)>0 && (dd+(m-1)*b2-k*(n-(ll)i-(m-1)))<=0) break;
      if(dd+m*b2-k*(n-(ll)i-m)<=0) l=m;
      else r=m;
    }
    ans=min(ans,a*(ll)i+b*m);
  }
  pr(ans);  
  return 0;
}

Submission Info

Judge Result