提出 #51387866

---

ソースコード 拡げる

#ifndef LOCAL
#include <algorithm>
#include <iostream>
#include <vector>
#include <fstream>
#include <string>
#include <deque>
#include <iomanip>
#include <tuple>
#include <cmath>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <cstdlib>
#include <cassert>
#include <random>
#include <ctime>
#include <bitset>
#include <chrono>
#include <array>
#include <complex>
#else
#ifdef DEBUG
#include <bits/stdc++_deb.h>
#else
#include <bits/stdc++.h>
#endif
#endif

using namespace std;

using ll = long long;
using ld = long double;

const int inf = 1e9;

ll cost(ll cnt5, ll sum, ll cnt, ll p4, ll p5) {
    ll l = -1, r = 1e15;
    while (r - l > 1) {
        ll m = (l + r) / 2;
        if (m * 4 + cnt5 * 5 + sum < 3 * (cnt + cnt5 + m)) {
            l = m;
        } else {
            r = m;
        }
    }
    return r * p4 + cnt5 * p5;
}

void solve() {
    array<ll, 5> a;
    ll sum = 0, cnt = 0;
    for (int i = 0; i < 5; i++) {
        cin >> a[i];
        sum += a[i] * (i + 1);
        cnt += a[i];
    }
    array<ll, 5> p;
    for (int i = 0; i < 5; i++) {
        cin >> p[i];
    }
    if (sum >= 3 * cnt) {
        cout << 0 << '\n';
        return;
    }
    ll l = 0, r = 1e15;
    while (r - l > 1) {
        ll m = (l + r) / 2;
        if (cost(m, sum, cnt, p[3], p[4]) >= cost(m + 1, sum, cnt, p[3], p[4])) {
            l = m;
        } else {
            r = m;
        }
    }
    ll mcost = min(cost(r, sum, cnt, p[3], p[4]), cost(l, sum, cnt, p[3], p[4]));
    cout << mcost << '\n';
}

int main() {
    //freopen("input.txt", "r", stdin);
    //freopen("outputik.txt", "w", stdout);

    ios_base::sync_with_stdio(false), cin.tie(nullptr);

    int t = 1;
    cin >> t;
    for (int i = 0; i < t; i++) solve();
}

提出情報

ジャッジ結果