結果
問題 | No.2364 Knapsack Problem |
ユーザー | karinohito |
提出日時 | 2023-09-06 19:00:06 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 635 ms / 3,000 ms |
コード長 | 3,732 bytes |
コンパイル時間 | 4,652 ms |
コンパイル使用メモリ | 269,824 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-24 13:24:29 |
合計ジャッジ時間 | 9,624 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,944 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | AC | 56 ms
6,944 KB |
testcase_08 | AC | 2 ms
6,944 KB |
testcase_09 | AC | 3 ms
6,940 KB |
testcase_10 | AC | 15 ms
6,944 KB |
testcase_11 | AC | 2 ms
6,940 KB |
testcase_12 | AC | 413 ms
6,940 KB |
testcase_13 | AC | 353 ms
6,940 KB |
testcase_14 | AC | 311 ms
6,940 KB |
testcase_15 | AC | 494 ms
6,940 KB |
testcase_16 | AC | 343 ms
6,944 KB |
testcase_17 | AC | 417 ms
6,940 KB |
testcase_18 | AC | 369 ms
6,940 KB |
testcase_19 | AC | 635 ms
6,940 KB |
testcase_20 | AC | 600 ms
6,940 KB |
testcase_21 | AC | 375 ms
6,944 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; #include <atcoder/all> using namespace atcoder; using ll = long long; using vll = vector<ll>; using vvll = vector<vll>; using vvvll = vector<vvll>; using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>; #define all(A) A.begin(),A.end() #define rep(i, n) for (ll i = 0; i < (ll) (n); i++) template<class T> bool chmax(T& p, T q, bool C = 1) { if (C == 0 && p == q) { return 1; } if (p < q) { p = q; return 1; } else { return 0; } } template<class T> bool chmin(T& p, T q, bool C = 1) { if (C == 0 && p == q) { return 1; } if (p > q) { p = q; return 1; } else { return 0; } } ll modPow(long long a, long long n, long long p) { if (n == 0) return 1; // 0乗にも対応する場合 if (n == 1) return a % p; if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p; long long t = modPow(a, n / 2, p); return (t * t) % p; } ll gcd(ll(a), ll(b)) { if (a == 0)return b; if (b == 0)return a; ll c = a; while (a % b != 0) { c = a % b; a = b; b = c; } return b; } ll sqrtz(ll N) { ll L = 0; ll R = sqrt(N) + 10000; while (abs(R - L) > 1) { ll mid = (R + L) / 2; if (mid * mid <= N)L = mid; else R = mid; } return L; } using mint = modint998244353; using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; vector<mint> fact, factinv, inv; const ll mod = 998244353; void prenCkModp(ll n) { fact.resize(n + 5); factinv.resize(n + 5); inv.resize(n + 5); fact[0] = fact[1] = 1; factinv[0] = factinv[1] = 1; inv[1] = 1; for (ll i = 2; i < n + 5; i++) { fact[i] = (fact[i - 1] * i); inv[i] = (mod - ((inv[mod % i] * (mod / i)))); factinv[i] = (factinv[i - 1] * inv[i]); } } mint nCk(ll n, ll k) { if (n < k || k < 0) return 0; return (fact[n] * ((factinv[k] * factinv[n - k]))); } template<typename S> S LongestCommonSubsequence(S a,S b){ int n=(int)a.size(),m=(int)b.size(); vector<vector<int>> dp(n+1,vector<int>(m+1,0)),pre(n+1,vector<int>(m+1,-1)); for(int i=0;i<=n;i++)for(int j=0;j<=m;j++){ if(i<n and j<m and a[i]==b[j]){ if(chmax(dp[i+1][j+1],dp[i][j]+1)) pre[i+1][j+1]=1; } if(i<n)if(chmax(dp[i+1][j],dp[i][j])) pre[i+1][j]=2; if(j<m)if(chmax(dp[i][j+1],dp[i][j])) pre[i][j+1]=3; } S ret; int i=n,j=m; while(i and j and pre[i][j]>0){ if(pre[i][j]==1){ i--,j--; ret.push_back(a[i]); } else if(pre[i][j]==2) i--; else if(pre[i][j]==3) j--; } reverse(begin(ret),end(ret)); return ret; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); ll N,M,W; cin>>N>>M>>W; vll A(N),B(N),C(M),D(M); rep(i,N)cin>>A[i];rep(i,N)cin>>B[i]; rep(i,M)cin>>C[i];rep(i,M)cin>>D[i]; ll an=0; vll P(N),Q(M); rep(i,N)P[i]=i; rep(j,M)Q[j]=j; do{ sort(all(Q)); do{ ll L=0,R=0; ll res=0; ll w=0; while(1){ bool CH=0; if(L<N&&w+A[P[L]]<=W){ res+=B[P[L]]; w+=A[P[L]]; L++;CH=1; } else if(R<M&&w-C[Q[R]]>=0){ res-=D[Q[R]]; w-=C[Q[R]]; R++;CH=1; } chmax(an,res); if(!CH)break; } }while(next_permutation(all(Q))); }while(next_permutation(all(P))); cout<<an<<endl; }