結果

問題 No.2730 Two Types Luggage
ユーザー Today03Today03
提出日時 2024-04-19 21:33:48
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 570 ms / 2,000 ms
コード長 3,030 bytes
コンパイル時間 2,137 ms
コンパイル使用メモリ 202,956 KB
実行使用メモリ 19,044 KB
最終ジャッジ日時 2024-04-19 21:34:15
合計ジャッジ時間 13,353 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 1 ms
6,940 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 6 ms
6,940 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 2 ms
6,944 KB
testcase_07 AC 2 ms
6,944 KB
testcase_08 AC 1 ms
6,944 KB
testcase_09 AC 3 ms
6,940 KB
testcase_10 AC 15 ms
6,940 KB
testcase_11 AC 347 ms
14,984 KB
testcase_12 AC 570 ms
18,628 KB
testcase_13 AC 304 ms
12,508 KB
testcase_14 AC 360 ms
15,084 KB
testcase_15 AC 149 ms
6,940 KB
testcase_16 AC 141 ms
7,424 KB
testcase_17 AC 463 ms
18,052 KB
testcase_18 AC 438 ms
16,792 KB
testcase_19 AC 38 ms
6,944 KB
testcase_20 AC 166 ms
8,624 KB
testcase_21 AC 359 ms
14,104 KB
testcase_22 AC 489 ms
18,792 KB
testcase_23 AC 46 ms
6,944 KB
testcase_24 AC 196 ms
9,728 KB
testcase_25 AC 390 ms
14,992 KB
testcase_26 AC 98 ms
6,940 KB
testcase_27 AC 328 ms
14,116 KB
testcase_28 AC 179 ms
9,176 KB
testcase_29 AC 428 ms
16,964 KB
testcase_30 AC 102 ms
6,940 KB
testcase_31 AC 268 ms
12,528 KB
testcase_32 AC 239 ms
11,264 KB
testcase_33 AC 559 ms
18,840 KB
testcase_34 AC 553 ms
18,840 KB
testcase_35 AC 547 ms
18,904 KB
testcase_36 AC 534 ms
19,044 KB
testcase_37 AC 552 ms
18,888 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

template <ll MOD>
struct modint {
    ll value;
    modint(ll x = 0) {
        if (x >= 0) {
            value = x % MOD;
        } else {
            value = MOD - (-x) % MOD;
        }
    }
    modint operator-() const {
        return modint(-value);
    }
    modint operator+() const {
        return modint(*this);
    }
    modint &operator+=(const modint &other) {
        value += other.value;
        if (value >= MOD) {
            value -= MOD;
        }
        return *this;
    }
    modint &operator-=(const modint &other) {
        value += MOD - other.value;
        if (value >= MOD) {
            value -= MOD;
        }
        return *this;
    }
    modint &operator*=(const modint other) {
        value = value * other.value % MOD;
        return *this;
    }
    modint &operator/=(modint other) {
        (*this) *= other.inv();
        return *this;
    }
    modint operator+(const modint &other) const {
        return modint(*this) += other;
    }
    modint operator-(const modint &other) const {
        return modint(*this) -= other;
    }
    modint operator*(const modint &other) const {
        return modint(*this) *= other;
    }
    modint operator/(const modint &other) const {
        return modint(*this) /= other;
    }
    modint pow(ll x) const {
        modint ret(1), mul(value);
        while (x) {
            if (x & 1) {
                ret *= mul;
            }
            mul *= mul;
            x >>= 1;
        }
        return ret;
    }
    modint inv() const {
        return pow(MOD - 2);
    }
    bool operator==(const modint &other) const {
        return value == other.value;
    }
    bool operator!=(const modint &other) const {
        return value != other.value;
    }
    friend ostream &operator<<(ostream &os, const modint &x) {
        return os << x.value;
    }
    friend istream &operator>>(istream &is, modint &x) {
        ll v;
        is >> v;
        x = modint<MOD>(v);
        return is;
    }
};
using mod998 = modint<998244353>;
using mod107 = modint<1000000007>;

using mint = mod998;

int main() {
    int N, M;
    ll W;
    cin >> N >> M >> W;
    vector<ll> A(N), B(M), C(M);
    for (int i = 0; i < N; i++) {
        cin >> A[i];
    }
    for (int i = 0; i < M; i++) {
        cin >> B[i];
    }
    for (int i = 0; i < M; i++) {
        cin >> C[i];
    }

    sort(A.rbegin(), A.rend());
    vector<ll> sumA(N + 1, 0);
    for (int i = 0; i < N; i++) {
        sumA[i + 1] = sumA[i] + A[i];
    }

    ll ans = 0;
    for (int i = 0; i < 1 << M; i++) {
        ll weight = 0, value = 0;

        for (int j = 0; j < M; j++) {
            if (i >> j & 1) {
                weight += B[j];
                value += C[j];
            }
        }

        if (weight > W) {
            continue;
        }

        value += sumA[min<ll>(N, W - weight)];

        ans = max(ans, value);
    }

    cout << ans << endl;
}
0