結果

問題 No.2309 [Cherry 5th Tune D] 夏の先取り
コンテスト
ユーザー sten_san
提出日時 2023-05-19 22:53:21
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 14 ms / 3,000 ms
コード長 3,997 bytes
コンパイル時間 1,956 ms
コンパイル使用メモリ 194,772 KB
最終ジャッジ日時 2025-02-13 02:59:58
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 50
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return vector(arg, init);
    else return vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename Container>
auto distance(const Container &c, decltype(begin(c)) iter) {
    return distance(begin(c), iter);
}

template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>
auto isort(RIter first, RIter last, Compare comp = Compare()) {
    vector<int> i(distance(first, last));
    iota(begin(i), end(i), 0);
    sort(begin(i), end(i), [&](auto x, auto y) {
        return comp(*(first + x), *(first + y));
    });
    return i;
}

template <typename, template <typename> typename, typename = void_t<>>
struct detect : false_type {};
template <typename T, template <typename> typename Check>
struct detect<T, Check, void_t<Check<T>>> : true_type {};
template <typename T, template <typename> typename Check>
constexpr inline bool detect_v = detect<T, Check>::value;

template <typename T>
using has_member_sort = decltype(declval<T>().sort());

template <typename Container, typename Compare = less<typename Container::value_type>>
auto sorted(Container c, Compare comp = Compare()) {
    if constexpr (detect_v<Container, has_member_sort>) {
        c.sort(comp);
        return c;
    }
    else {
        sort(begin(c), end(c), comp);
        return c;
    }
}

template <typename Container, typename Compare = equal_to<typename Container::value_type>>
auto uniqued(Container c, Compare comp = Compare()) {
    c.erase(unique(begin(c), end(c), comp), end(c));
    return c;
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

template <typename F>
constexpr auto fix(F &&f) noexcept {
    return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable {
        return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);
    };
}

int main() {
    int t; cin >> t;

    while (t--) {
        int64_t a, b, c; cin >> a >> b >> c;
        int64_t x, y, z, w; cin >> x >> y >> z >> w;

        if (x + y + z <= w + w) {
            int64_t ans = 0;

            for (int i = 0; i <= min({ a, b, c }); ++i) {
                a -= i; b -= i; c -= i;

                // ab bc: x y
                chmax(ans, w * i + min(a, b) * x + min(b - min(a, b), c) * y);
                chmax(ans, w * i + min(b, c) * y + min(b - min(b, c), a) * x);

                // bc ca: y z
                chmax(ans, w * i + min(b, c) * y + min(c - min(b, c), a) * z);
                chmax(ans, w * i + min(c, a) * z + min(c - min(c, a), b) * y);

                // ca ab: z x
                chmax(ans, w * i + min(c, a) * z + min(a - min(c, a), b) * x);
                chmax(ans, w * i + min(a, b) * x + min(a - min(a, b), c) * z);

                a += i; b += i; c += i;
            }

            cout << ans << endl;

            continue;
        }

        int64_t ans = 0;

        for (int i = 0; i <= min(a, b); ++i) {
            a -= i; b -= i;

            for (int j = 0; j <= (1 <= min({ a, b, c })); ++j) {
                a -= j; b -= j; c -= j;

                chmax(ans, x * i + w * j + min(b, c) * y + min(c - min(b, c), a) * z);
                chmax(ans, x * i + w * j + min(c, a) * z + min(c - min(c, a), b) * y);

                a += j; b += j; c += j;
            }

            a += i; b += i;
        }

        cout << ans << endl;
    }
}
0