結果
問題 | No.2730 Two Types Luggage |
ユーザー |
|
提出日時 | 2024-04-19 21:47:01 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 227 ms / 2,000 ms |
コード長 | 2,668 bytes |
コンパイル時間 | 3,223 ms |
コンパイル使用メモリ | 225,228 KB |
最終ジャッジ日時 | 2025-02-21 04:04:33 |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 35 |
ソースコード
#pragma clang diagnostic push#pragma ide diagnostic ignored "cppcoreguidelines-narrowing-conversions"#pragma ide diagnostic ignored "hicpp-signed-bitwise"#pragma GCC optimize ("Ofast,unroll-loops")#pragma GCC optimize("no-stack-protector,fast-math")#include <bits/stdc++.h>using namespace std;typedef long long ll;typedef pair<ll, ll> pll;typedef pair<int, int> pii;typedef pair<double, double> pdd;typedef vector<int> vi;typedef vector<ll> vll;typedef vector<double> vd;typedef vector<string> vs;typedef vector<vi> vvi;typedef vector<vvi> vvvi;typedef vector<vll> vvll;typedef vector<vvll> vvvll;typedef vector<pii> vpii;typedef vector<vpii> vvpii;typedef vector<pll> vpll;typedef vector<vpll> vvpll;typedef vector<pdd> vpdd;typedef vector<vd> vvd;#define yn(ans) printf("%s\n", (ans)?"Yes":"No");#define YN(ans) printf("%s\n", (ans)?"YES":"NO");template<class T> bool chmax(T &a, T b) {if (a >= b) return false;a = b; return true;}template<class T> bool chmin(T &a, T b) {if (a <= b) return false;a = b; return true;}#define FOR(i, s, e, t) for ((i) = (s); (i) < (e); (i) += (t))#define REP(i, e) for (int i = 0; i < (e); ++i)#define REP1(i, s, e) for (int i = (s); i < (e); ++i)#define RREP(i, e) for (int i = (e); i >= 0; --i)#define RREP1(i, e, s) for (int i = (e); i >= (s); --i)#define all(v) v.begin(), v.end()#define pb push_back#define qb pop_back#define pf push_front#define qf pop_front#define maxe max_element#define mine min_elementll inf = 1e18;#define DEBUG printf("%d\n", __LINE__); fflush(stdout);template<class T> void print(vector<T> &v, bool withSize = false) {if (withSize) cout << v.size() << endl;REP(i, v.size()) cout << v[i] << " ";cout << endl;}mt19937_64 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());int __FAST_IO__ = []() {std::ios::sync_with_stdio(0);std::cin.tie(0);std::cout.tie(0);return 0;}();#define TESTS int t; cin >> t; while (t--)#define TESTint main() {TEST {int N, M; ll W;cin >> N >> M >> W;vll A(N), B(M), C(M);REP(i, N) cin >> A[i];REP(i, M) cin >> B[i];REP(i, M) cin >> C[i];sort(all(A), greater<ll>());REP1(i, 1, N) A[i] += A[i - 1];vll dpB(1 << M, 0), dpC(1 << M, 0);ll ans = 0;REP(i, 1 << M) {if (i > 0) {int j = __builtin_ctz(i), ni = i ^ (1 << j);dpB[i] = dpB[ni] + B[j];dpC[i] = dpC[ni] + C[j];}if (dpB[i] <= W) {int left = min((ll)N, W - dpB[i]);chmax(ans, dpC[i] + (left == 0 ? 0 : A[left - 1]));}}printf("%lld\n", ans);}return 0;}