Submission #213950

---

Source Code Expand

// compile in C++11. use -std=c++11.
#include <iostream>
#include <iomanip>
#include <vector>
#include <valarray>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <stack>
#include <bitset>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <complex>
#include <string>
#include <sstream>

#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cstring>

// these require C++11
#include <unordered_set>
#include <unordered_map>
#include <random>

using namespace std;

#define all(c) c.begin(),c.end()
#define repeat(i,n) for(int i=0;i<static_cast<int>(n);i++)
#define debug(x) #x << "=" << (x)
#define dump(x) cerr << debug(x) << " (L:" << __LINE__ << ")"<< endl

typedef long long ll;
typedef complex<double> point;

template<typename T>
ostream& operator<<(ostream& os,const vector<T>& vec){
    os << "[";
    for(const auto& v : vec){
        os << v << ",";
    }
    os << "]";
    return os;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll N,H;
    ll A,B,C,D,E;
    cin >> N >> H;
    cin >> A >> B >> C >> D >> E;
    // もし，全部食べない場合には，最後は，H-E*N.
    ll ini = H-E*N;
    B+=E;
    D+=E;
    ll ret = A*N;
    // 最初のX日食べると仮定する．
    for(ll X=0;X<=N;X++){
        if(B*X+ini <= 0) continue;
        ll lower = 0;
        ll upper = X;
        for(int i=0;i<50;i++){
            ll mid = (lower+upper)/2;
            ll normal = mid;
            ll poor = X-mid;
            if(B*normal + D*poor + ini > 0){
                upper = mid;
            }else{
                lower = mid;
            }
        }
        ret = min(ret,A*upper+C*(X-upper));
    }
    cout << ret << endl;
    return 0;
}

Submission Info

Judge Result