結果
問題 | No.2364 Knapsack Problem |
ユーザー |
![]() |
提出日時 | 2023-06-30 21:34:39 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 10 ms / 3,000 ms |
コード長 | 4,032 bytes |
コンパイル時間 | 18,802 ms |
コンパイル使用メモリ | 261,696 KB |
最終ジャッジ日時 | 2025-02-15 03:34:02 |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 20 |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <algorithm> #include <atcoder/all> #include <bitset> #include <cassert> #include <cmath> #include <ctime> #include <functional> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <random> #include <set> #include <stack> #include <string> #include <tuple> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector<int> #define vs vector<string> #define vc vector<char> #define vl vector<ll> #define vb vector<bool> #define vvi vector<vector<int>> #define vvc vector<vector<char>> #define vvl vector<vector<ll>> #define vvb vector<vector<bool>> #define vvvi vector<vector<vector<int>>> #define vvvl vector<vector<vector<ll>>> #define pii pair<int, int> #define pil pair<int, ll> #define pli pair<ll, int> #define pll pair<ll, ll> #define vpii vector<pair<int, int>> #define vpll vector<pair<ll, ll>> #define vvpii vector<vector<pair<int, int>>> #define vvpll vector<vector<pair<ll, ll>>> using mint = modint998244353; template <typename T> void debug(T e) { cerr << e << endl; } template <typename T> void debug(vector<T> &v) { rep(i, v.size()) { cerr << v[i] << " "; } cerr << endl; } template <typename T> void debug(vector<vector<T>> &v) { rep(i, v.size()) { rep(j, v[i].size()) { cerr << v[i][j] << " "; } cerr << endl; } } template <typename T> void debug(vector<pair<T, T>> &v) { rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; } } template <typename T> void debug(set<T> &st) { for (auto itr = st.begin(); itr != st.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template <typename T> void debug(multiset<T> &ms) { for (auto itr = ms.begin(); itr != ms.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template <typename T> void debug(map<T, T> &mp) { for (auto itr = mp.begin(); itr != mp.end(); itr++) { cerr << itr->first << " " << itr->second << endl; } } void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << H << " "; debug_out(T...); } int main() { ll N, M, W; cin >> N >> M >> W; vl A(N); vl B(N); for (ll i = 0; i < N; i++) { cin >> A[i]; } for (ll i = 0; i < N; i++) { cin >> B[i]; } vl C(M); vl D(M); for (ll i = 0; i < M; i++) { cin >> C[i]; } for (ll i = 0; i < M; i++) { cin >> D[i]; } ll INF = 8000000000000000000; vector<ll> bitdp(1 << (N + M), -INF); bitdp[0] = 0; for (ll i = 0; i < (1 << (N + M)); i++) { for (ll j = 0; j < (N + M); j++) { if ((i >> j) & 1) { continue; } ll weight = 0; for (ll k = 0; k < N; k++) { if ((i >> k) & 1) { weight += A[k]; } } for (ll k = 0; k < M; k++) { if ((i >> (k + N)) & 1) { weight -= C[k]; } } ll value = 0; if (j < N) { weight += A[j]; value += B[j]; } else { weight -= C[j - N]; value -= D[j - N]; } if (0 <= weight && weight <= W) { bitdp[i | (1 << j)] = max(bitdp[i | (1 << j)], bitdp[i] + value); } } } ll ans = 0; for (ll i = 0; i < (1 << (N + M)); i++) { ans = max(ans, bitdp[i]); } cout << ans << endl; }