提出 #51399560

---

ソースコード 拡げる

#include "bits/stdc++.h"

using namespace std;
using ll = long long;

#ifndef ONLINE_JUDGE
#include "debug.h"
#else
#define deb(x...)
#endif

#define int         long long
#define ull         unsigned long long
#define all(x)      x.begin(), x.end()
#define rev(x)      x.rbegin(), x.rend()
#define uid(a, b)   uniform_int_distribution<long long>(a, b)(rng)

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll INF = (ll)1e18;
const int mod = (int)1e9 + 7;

ll floor (ll a, ll b) {
    return a / b - ((a ^ b) < 0 and a % b);
}

ll ceil (ll a, ll b) {
    return floor(a, b) + (a % b != 0);
}

void solve() {
    array<int, 5> a, p;
    for (auto &x : a) cin >> x;
    for (auto &x : p) cin >> x;

    int num = 0, den = 0;
    for (int i = 0; i < 5; i++) {
        num += a[i] * (i + 1);
        den += a[i];
    }

    if (num >= 3 * den or !p[3] or !p[4]) return void(cout << "0\n");

    int c = 3 * den - num;
    auto check = [&](int m) -> bool {
        if (p[4] <= p[3]) {
            return ceil(c, 2) * p[4] <= m;
        } else if (2 * p[3] - p[4] > 0) {
            return max(ceil(c, 2), 1ll) <= min(floor(m - c * (p[4] - p[3]), 2 * p[3] - p[4]), floor(m, p[3]));
        } else if (2 * p[3] - p[4] < 0) {
            return max({ceil(m - c * (p[4] - p[3]), 2 * p[3] - p[4]), ceil(c, 2), 1ll}) <= floor(m, p[3]);
        } else {
            return max(ceil(c, 2), 1ll) <= floor(m, p[3]) and m >= c * (p[4] - p[3]);
        }
    };

    int lo = 0, hi = INF, ans = -1;
    while (lo <= hi) {
        int mid = (lo + hi) >> 1;
        if (check(mid)) {
            ans = mid;
            hi = mid - 1;
        }
        else lo = mid + 1;
    }
    assert(ans != -1);
    cout << ans << "\n";
}

int32_t main() {

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int TESTS; cin >> TESTS;
    while (TESTS--) solve();

    return 0;
}

提出情報

ジャッジ結果