結果

問題 No.2364 Knapsack Problem
ユーザー mikammikam
提出日時 2023-07-01 13:17:46
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,906 bytes
コンパイル時間 4,492 ms
コンパイル使用メモリ 245,016 KB
実行使用メモリ 4,392 KB
最終ジャッジ日時 2023-09-22 07:12:56
合計ジャッジ時間 8,348 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 10 ms
4,376 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 3 ms
4,380 KB
testcase_05 AC 91 ms
4,380 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 AC 3 ms
4,380 KB
testcase_09 AC 53 ms
4,376 KB
testcase_10 AC 10 ms
4,380 KB
testcase_11 AC 2 ms
4,376 KB
testcase_12 AC 339 ms
4,380 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 AC 355 ms
4,380 KB
testcase_21 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

// #include "atcoder/convolution"
#include "atcoder/dsu"
#include "atcoder/fenwicktree"
#include "atcoder/lazysegtree"
#include "atcoder/math"
#include "atcoder/maxflow"
#include "atcoder/mincostflow"
#include "atcoder/modint"
#include "atcoder/scc"
#include "atcoder/segtree"
#include "atcoder/string"
#include "atcoder/twosat"
using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
// #include <boost/multiprecision/cpp_int.hpp>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i,a,b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(),v.end()
#define inc(x,l,r) ((l)<=(x)&&(x)<(r)) 
#define Unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())
#define pcnt __builtin_popcountll
typedef long long ll;
#define int ll
using ld = long double;
using vi = vector<int>;
using vs = vector<string>;
using P = pair<int,int>;
using vp = vector<P>;
// using Bint = boost::multiprecision::cpp_int;
template<typename T1,typename T2> bool chmax(T1 &a, const T2 b) {if (a < b) {a = b; return true;} else return false; }
template<typename T1,typename T2> bool chmin(T1 &a, const T2 b) {if (a > b) {a = b; return true;} else return false; }
template<typename T> using priority_queue_greater = priority_queue<T, vector<T>, greater<T>>;
template<typename T> istream &operator>>(istream& is,vector<T> &v){for(T &in:v)is>>in;return is;}
template<typename T1,typename T2> ostream &operator<< (ostream &os, const pair<T1,T2> &p){os << p.first <<" "<<p.second;return os;}
ostream &operator<< (ostream &os, const modint1000000007 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint1000000007 &m){ll in;is>>in;m=in;return is;}
ostream &operator<< (ostream &os, const modint998244353 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint998244353 &m){ll in;is>>in;m=in;return is;}
template<class... T> void input(T&... a){(cin>> ... >> a);}
#ifdef LOCAL
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){os<<"\x1b[32m";rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");os<<"\x1b[0m";return os;}
template<class T> void print(T& a){cout << "\x1b[32m"<< a<< '\n' << "\x1b[0m";}
template<class T,class... Ts> void print(const T&a, const Ts&... b){cout << "\x1b[32m" << a;(cout<<...<<(cout<<' ',b));cout<<'\n' << "\x1b[0m";}
#else
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<class T> void print(T& a){cout << a<< '\n';}
template<class T,class... Ts> void print(const T&a, const Ts&... b){cout << a;(cout<<...<<(cout<<' ',b));cout<<'\n';}
#endif
#define VI(v,n) vi v(n); input(v)
#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)
#define CHAR(...) char __VA_ARGS__; input(__VA_ARGS__)
int sign(ll x){return x>0?1:x<0?-1:0;}
ll ceil(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return (x+y-1)/y;return -((-x/y));}
ll floor(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return x/y;if(y<0)x*=-1,y*=-1;return x/y-(x%y<0);}
ll abs(ll x,ll y){return abs(x-y);}
ll bit(int n){return 1ll<<n;}
bool ins(string s,string t){return s.find(t)!=string::npos;}
P operator+ (const P &p, const P &q){ return P{p.first+q.first,p.second+q.second};}
P operator- (const P &p, const P &q){ return P{p.first-q.first,p.second-q.second};}
int yesno(bool ok,string y="Yes",string n="No"){ cout<<(ok?y:n)<<endl;return 0;}
int YESNO(bool ok,string y="YES",string n="NO"){ cout<<(ok?y:n)<<endl;return 0;}
int di[]={-1,0,1,0,-1,-1,1,1};
int dj[]={0,1,0,-1,-1,1,-1,1};
const ll INF = 1e18;
//using mint = modint1000000007;
//using mint = modint998244353;
//mint stom(const string &s,int b=10){mint res = 0;for(auto c:s)res *= b,res += c-'0';return res;}

signed main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    INT(n,m,W);
    vi a(n),b(n),c(m),d(m);
    cin>>a>>b>>c>>d;
    vector dp(W+1,vi(1<<m,-INF));
    dp[0][0] = 0;
    rep(i,n){
        vector pd(W+1,vi(1<<m,-INF));
        rep(j,W+1)rep(s,1<<m){
            auto f = [&](int u){
                rep(s2,1<<m){
                    if(s&s2)continue;
                    int ds = 0;
                    int nj = j;
                    nj += u*a[i];
                    if(nj>W)continue;
                    bool val = true;
                    rep(k,m)if(s2>>k&1){
                        nj -= c[k];
                        if(nj<0)val = false;
                        ds += d[k];
                    }
                    if(val)chmax(pd[nj][s|s2],dp[j][s]+u*b[i]-ds);
                }
            };f(0),f(1);
        }
        swap(dp,pd);
        // rep(j,W+1)rep(k,1<<m)print(j,k,dp[j][k]);
    }
    int ans = 0;
    rep(j,W+1)rep(s,1<<m)chmax(ans,dp[j][s]);
    print(ans);
    return 0;
}
0