結果
問題 | No.2364 Knapsack Problem |
ユーザー | 👑 eoeo |
提出日時 | 2023-07-01 15:56:26 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 154 ms / 3,000 ms |
コード長 | 6,698 bytes |
コンパイル時間 | 2,598 ms |
コンパイル使用メモリ | 256,716 KB |
実行使用メモリ | 67,840 KB |
最終ジャッジ日時 | 2024-07-08 02:08:29 |
合計ジャッジ時間 | 4,969 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 5 ms
6,944 KB |
testcase_06 | AC | 3 ms
6,944 KB |
testcase_07 | AC | 14 ms
8,704 KB |
testcase_08 | AC | 2 ms
6,944 KB |
testcase_09 | AC | 14 ms
10,368 KB |
testcase_10 | AC | 6 ms
6,940 KB |
testcase_11 | AC | 3 ms
6,944 KB |
testcase_12 | AC | 138 ms
67,840 KB |
testcase_13 | AC | 134 ms
67,840 KB |
testcase_14 | AC | 139 ms
67,840 KB |
testcase_15 | AC | 146 ms
67,840 KB |
testcase_16 | AC | 138 ms
67,840 KB |
testcase_17 | AC | 138 ms
67,712 KB |
testcase_18 | AC | 142 ms
67,840 KB |
testcase_19 | AC | 154 ms
67,840 KB |
testcase_20 | AC | 146 ms
67,840 KB |
testcase_21 | AC | 137 ms
67,840 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; #ifdef MY_DEBUG #define dbg(...) debug_out(__VA_ARGS__) #define dbgn(var) debug_out(#var, "=", var) #else #define dbg(...) #define dbgn(...) #endif void debug_out(); template <class Head, class... Tail> void debug_out(Head, Tail...); template <class T> bool chmax(T&, const T&); template <class T> bool chmin(T&, const T&); template <class T> T pwr(T, ll); template <class T> T squ(T x) { return x * x; } ll fact(ll); ll comb(ll, ll); ll ctoll(char); char lltoc(ll); bool flg(ll b, ll i) { return ((b) >> (i)) & 1LL; } // flg(0b010, 1LL) -> true const ll LINF = (ll)1e18 + 7; const double EPS = 1e-9; const int MAX_DUBUG_SIZE = 30; void solve([[maybe_unused]] int test) { ll n, m, w; cin >> n >> m >> w; vector<ll> a(n), b(n), c(m), d(m); for (ll i = 0; i < n; i++) { cin >> a[i]; } for (ll i = 0; i < n; i++) { cin >> b[i]; } for (ll i = 0; i < m; i++) { cin >> c[i]; } for (ll i = 0; i < m; i++) { cin >> d[i]; } ll sz = n + m; vector<ll> w_com(sz), v_com(sz); for (ll i = 0; i < n; i++) { w_com[i] = a[i]; v_com[i] = b[i]; } for (ll i = 0; i < m; i++) { w_com[i + n] = -c[i]; v_com[i + n] = -d[i]; } const int max_bit = 1 << sz; vector<vector<ll>> dp(max_bit, vector<ll>(w + 1, -LINF)); dp[0][0] = 0; ll ans = 0; for (ll i = 0; i < max_bit; i++) { for (ll j = 0; j < sz; j++) { if (flg(i, j)) continue; for (ll k = 0; k < w + 1; k++) { if (0 > k + w_com[j] or k + w_com[j] > w) continue; chmax(dp[i | (1 << j)][k + w_com[j]], dp[i][k] + v_com[j]); } } ll ma = *(max_element(dp[i].begin(), dp[i].end())); chmax(ans, ma); } cout << ans << endl; } int main() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(12); int testcase_size = 1; // cin >> testcase_size; for (int _t = 0; _t < testcase_size; _t++) { solve(_t); } } /* -----------------------------------MY_FUNCTIONS------------------------------------ */ template <class First, class Second> ostream& operator<<(ostream& os, const pair<First, Second>& pp) { return os << "{" << pp.first << "," << pp.second << "}"; } template <class T> ostream& operator<<(ostream& os, const vector<T>& V) { if (V.empty()) return os << "[]"; os << "["; for (ll i = 0; i < (ll)V.size(); i++) { os << V[i] << (i == int(V.size() - 1) ? "]" : ","); } return os; } template <class T> ostream& operator<<(ostream& os, const vector<vector<T>>& VV) { if (VV.empty()) return os << "[[]]"; os << "[\n"; for (auto&& V : VV) { os << V << "\n"; } os << "]"; return os; } template <class T> ostream& operator<<(ostream& os, const vector<vector<vector<T>>>& VVV) { if (VVV.empty()) return os << "[[[]]]"; os << "[" << "\n"; int cnt = 0; for (auto&& VV : VVV) { os << cnt++ << VV << "\n\n"; } os << "]"; return os; } template <class T> ostream& operator<<(ostream& os, const set<T>& SS) { if (SS.empty()) return os << "[]"; os << "["; auto ii = SS.begin(); for (; ii != SS.end(); ii++) os << *ii << (ii == prev(SS.end()) ? "]" : ","); return os; } template <class Key, class Tp> ostream& operator<<(ostream& os, const map<Key, Tp>& MM) { if (MM.empty()) return os << "[{:}]"; os << "["; auto ii = MM.begin(); for (; ii != MM.end(); ii++) os << "{" << ii->first << ":" << ii->second << "}" << (ii == prev(MM.end()) ? "]" : ","); return os; } void debug_out() { cerr << endl; } void debug_out_vl(vector<ll> V) { const int MAX_SIZE = min((int)V.size(), MAX_DUBUG_SIZE); cerr << "\033[33m"; if (V.empty()) { cerr << "[]" << endl; return; } cerr << "["; for (int i = 0; i < MAX_SIZE; i++) { if (V[i] == LINF) cerr << "INF"; else cerr << V[i]; if (i == (int)V.size() - 1) cerr << "]\n"; else if (i == MAX_DUBUG_SIZE - 1) cerr << ",...\n"; else cerr << ","; } return; } void debug_out_vvl(vector<vector<ll>> VV) { cerr << "\033[33m"; if (VV.empty()) { cerr << "[[]]" << endl; return; } cerr << "[\n"; int MAX_ROW = min((int)VV.size(), MAX_DUBUG_SIZE); for (int i = 0; i < MAX_ROW; i++) { const int MAX_COLUMN = min((int)VV[i].size(), MAX_DUBUG_SIZE); if (VV[i].empty()) { cerr << "[]" << endl; continue; } cerr << "["; for (int j = 0; j < MAX_COLUMN; j++) { if (VV[i][j] == LINF) cerr << "INF"; else cerr << VV[i][j]; if (j == (int)VV[i].size() - 1) cerr << "]\n"; else if (j == MAX_DUBUG_SIZE - 1) cerr << ",...\n"; else cerr << ","; } if (i != (int)VV.size() - 1 and i == MAX_DUBUG_SIZE - 1) { cerr << ":\n:\033[m\n"; return; } } cerr << "]\033[m\n"; return; } template <class Head, class... Tail> void debug_out(Head H, Tail... T) { if constexpr (std::is_same_v<Head, vector<ll>>) { debug_out_vl(H); } else if constexpr (std::is_same_v<Head, vector<vector<ll>>>) { debug_out_vvl(H); } else { cerr << "\033[33m" << H << "\033[m "; } debug_out(T...); } template <class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; } template <class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } return false; } template <class T> T pwr(T x, ll n) { T res = 1; for (int i = 0; i < n; i++) { res *= x; } return res; } ll fact(ll n) { ll res = 1; for (ll i = 1; i <= n; i++) res *= i; return res; } ll comb(ll n, ll r) { // comb(60, 30)までオーバーフローなし ll res = 1; for (int i = 1; i <= r; i++) { res *= n--; res /= i; } return res; } ll ctoll(char c) { if (c < '0' or '9' < c) { cerr << "\n\033[33m ctoll に '0'~'9' 以外の文字が入りました.\033[m\n" << endl; } return ll(c - '0'); } char lltoc(ll n) { if (n < 0 or 9 < n) { cerr << "\n\033[33m lltoc に 0 ~ 9 以外の数字が入りました.\033[m\n" << endl; } return char(n + '0'); }