Submission #19071044

---

Source Code Expand

#ifdef LOCAL
    // #define _GLIBCXX_DEBUG
    #define __clock__
#else
    #pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;

// tourist set
template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(char c){
  string s = {c};
  return s;
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << '\n'; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// tourist set end

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())
#define MP make_pair
#define p_yes() p("Yes")
#define p_no() p("No")
#define possible() p("Possible")
#define impossible() p("Impossible")
void yes(){p_yes(); exit(0);}
void no(){p_no(); exit(0);}

ll SUM(VI& V){
  return accumulate(ALL(V), 0LL);
}

ll MIN(VI& V){return *min_element(ALL(V));}
ll MAX(VI& V){return *max_element(ALL(V));}

void print_vector(VI& V, ll offset=0){
  ll n = V.size();
  rep(i, n){
    if(i) cout << ' ';
    cout << V[i]+offset;
  }
  cout << endl;
}

ll gcd(ll a,ll b){
    if(b == 0) return a;
    return gcd(b,a%b);
}

ll lcm(ll a,ll b){
    ll g = gcd(a,b);
    return a / g * b;
}

// long double
using ld = long double;
#define EPS (1e-14)
#define equals(a,b) (fabs((a)-(b)) < EPS)

// 小さい順に取り出すpriority queue
using inverse_priority_queue = priority_queue<ll, vector<ll>, greater<ll> >;

int popcount(ll t){
    return __builtin_popcountll(t);
}

const ll mod = 1e9 + 7;
// const ll mod = 998244353;
const ll inf = 1e18;
const double PI = acos(-1);

// [a/b] (繰り上げ)
ll ceil_div(ll a, ll b){
  return (a+b-1)/b;
}

ll string_to_ll(string s){
  return atoll(s.c_str());
}

// snuke's mint
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
// const int mod = 1000000007;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const {
    mint res(*this);
    return res+=a;
  }
  mint operator-(const mint a) const {
    mint res(*this);
    return res-=a;
  }
  mint operator*(const mint a) const {
    mint res(*this);
    return res*=a;
  }
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const {
    return pow(mod-2);
  }
  mint& operator/=(const mint a) {
    return (*this) *= a.inv();
  }
  mint operator/(const mint a) const {
    mint res(*this);
    return res/=a;
  }
};

// 半分全列挙VER
// N <= 30
// value <= 10^9
// weight <= 10^9
// capacity <= 10^9
ll knapsack_by_split(ll N, ll C, VI V, VI W){
  const int N_MAX=30;
  debug("knapsack_by_split");
  // 長さ30にする
  rep(i,N_MAX-N){
    V.push_back(0);
    W.push_back(0);
  }
  N=N_MAX;

  // (weight, value)のリストをいい感じに返す
  auto f = [](ll N, VI V, VI W){
    vector<PII> ret;
    rep(f,1<<N){
      ll val=0;
      ll wei=0;
      rep(i,N){
        if(f>>i&1){
          // 採用
          val += V[i];
          wei += W[i];
        }
      }
      ret.emplace_back(wei,val);
    }
    sort(ALL(ret));
    ll max_value = ret[0].second;
    // このweightを使うなら少なくともこのvalueを達成できるというのを入れる
    FOR(i,1,SZ(ret)){
      chmax(max_value, ret[i].second);
      ret[i].second = max_value;
    }
    return ret;
  };

  // 15個ずつに分ける
  vector<PII> A,B;
  {
    VI v,w;
    rep(i,N/2){
      v.push_back(V[i]);
      w.push_back(W[i]);
    }
    A = f(N/2, v, w);
  }
  {
    VI v,w;
    FOR(i,N/2,N){
      v.push_back(V[i]);
      w.push_back(W[i]);  
    }
    B = f(N/2, v, w);
  }
  
  // A側のそれぞれに対してB側を2分探索して容量C以内でマッチングさせる
  ll ma=0;
  for(auto pa : A){
    ll w = pa.first;
    ll v = pa.second;
    if(w>C)continue;
    
    // PII key = {C-w, 0LL};
    PII key = {C-w, inf};

    auto it = upper_bound(ALL(B), key);
    ll value_sum;
    if(it==B.begin()){
      value_sum = v;
    }else{
      it--;
      value_sum = v + it->second;
    }
    chmax(ma,value_sum);
  }
  return ma;
}

// N<=200
// weight <= 10^9
// value <= 1000
ll knapsack_by_small_value(ll N, ll C, VI V, VI W){
  debug("knapsack_by_small_value");
  VV dp(205, VI(210000, inf));
  // i番目まで見て
  // 価値jを達成する時に必要な最小の重さ
  dp[0][0]=0;
  rep(i,N){
    ll v = V[i];
    ll w = W[i];
    rep(j,200001){
      // j : 現在価値
      // とる
      chmin(dp[i+1][j+v], dp[i][j]+w);
      // とらない
      chmin(dp[i+1][j], dp[i][j]);
    }
  }
  ll ma=0;
  rep(v,210000){
    if(dp[N][v]<=C){
      chmax(ma,v);
    }
  }
  return ma;
}

// value <= 10^9
// weight <= 1000
// N <= 200
ll knapsack_by_small_weight(ll N, ll C, VI V, VI W){
  debug("knapsack_by_small_weight");
  VV dp(205, VI(210000, 0));
  // iまで見て
  // 重さjでの最大価値
  rep(i,N){
    ll v=V[i];
    ll w=W[i];
    rep(j,200000+1){
      // j : 現在の重さ
      // とる
      chmax(dp[i+1][j+w], dp[i][j]+v);
      // とらない
      chmax(dp[i+1][j], dp[i][j]);
    }
  }

  // Cが10^9もありうる
  C = min(200000LL,C);
  ll ma=0;
  rep(w,C+1){
    chmax(ma, dp[N][w]);
  }
  return ma;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll N,C;
    cin>>N>>C;

    VI V(N);
    VI W(N);
    rep(i, N){
      cin >> V[i] >> W[i];
    } 

    ll ans;
    if(MAX(V)<=1000){
      ans = knapsack_by_small_value(N,C,V,W);
    }
    else if(MAX(W)<=1000){
      ans = knapsack_by_small_weight(N,C,V,W);
    }
    else{
      // N<=30
      ans = knapsack_by_split(N,C,V,W);
    }

    p(ans);
    
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘ll knapsack_by_split(ll, ll, VI, VI)’:
./Main.cpp:107:20: warning: statement has no effect [-Wunused-value]
  107 | #define debug(...) 42
      |                    ^~
./Main.cpp:246:3: note: in expansion of macro ‘debug’
  246 |   debug("knapsack_by_split");
      |   ^~~~~
./Main.cpp: In function ‘ll knapsack_by_small_value(ll, ll, VI, VI)’:
./Main.cpp:107:20: warning: statement has no effect [-Wunused-value]
  107 | #define debug(...) 42
      |                    ^~
./Main.cpp:325:3: note: in expansion of macro ‘debug’
  325 |   debug("knapsack_by_small_value");
      |   ^~~~~
./Main.cpp: In function ‘ll knapsack_by_small_weight(ll, ll, VI, VI)’:
./Main.cpp:107:20: warning: statement has no effect [-Wunused-value]
  107 | #define debug(...) 42
      |                    ^~
./Main.cpp:354:3: note: in expansion of macro ‘debug’
  354 |   debug("knapsack_by_small_weight");
      |   ^~~~~

Judge Result