Submission #214357

---

Source Code Expand

import std.stdio;
import std.c.stdio;
import std.range;
import std.array;
import std.functional;
import std.algorithm;
import std.conv;
import std.container;
import std.math;
import std.numeric;
import std.string;
import std.c.string;
import std.regex;
import std.typecons;
 
void main() {
    long N, H; 
    long A, B, C, D, E;
    scanf("%d %d\n", &N, &H);
    scanf("%d %d %d %d %d\n", &A, &B, &C, &D, &E);


    long Ans = long.max;
    for (int x = 0; x <= N; x++) {
        //long lb = x * A, ub = N * C + x * A;
        long lb = 0, ub = N - x;
        bool Check(long y) {
            long F = x * A + y * C;
            long Z = N - (x + y);
            return F * D > Z * E * C - H * C - x * (B * C - A * D);
        }
        while (lb + 1 < ub) {
            long mid = (lb + ub) / 2;
            if (Check(mid)) {
                ub = mid;
            } else {
                lb = mid;
            }
        }
        Ans = min(Ans, x * A + ub * C);
    }
    writeln(Ans);
}

Submission Info

Judge Result