Dp/Knapsack.h

• View this file on GitHub
• Last update: 2025-10-06 23:30:53+07:00

Depends on

• template.h

Code

#include "../template.h"

// 1 <= N <= 100, 1 <= W <= 1e5
// 1 <= wi <= W, 1 <= vi <= 1e9
void knapsack01() {
    int n, W; cin >> n >> W;
    vector<int> w(n+1), v(n+1);
    for (int i = 1; i <= n; i++) {
        cin >> w[i] >> v[i];
    }
    vector<vector<ll>> dp(n+1, vector<ll>(W+1));
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= W; j++) {
            dp[i][j] = dp[i-1][j];
            if (j-w[i] < 0) continue;
            dp[i][j] = max(dp[i][j], dp[i-1][j-w[i]] + v[i]);
        }
    }
    cout << dp[n][W];
}

// 1 <= N <= 100, 1 <= W <= 1e9
// 1 <= wi <= W, 1 <= vi <= 1e3
void knapsack02() {
    int n, W; cin >> n >> W;
    vector<int> w(n+1), v(n+1);
    for (int i = 1; i <= n; i++) {
        cin >> w[i] >> v[i];
    }
    vector<vector<ll>> dp(n+1, vector<ll>(1e5+1, 1e18));
    for (int i = 0; i <= n; i++) {
        dp[i][0] = 0;
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= 1e5; j++) {
            dp[i][j] = dp[i-1][j];
            if (j-v[i] < 0) continue;
            if (dp[i-1][j-v[i]] + w[i] <= W) {
                dp[i][j] = min(dp[i][j], dp[i-1][j-v[i]] + w[i]);
            }
        }
    }
    for (int i = 1e5; i >= 0; i--) {
        if (dp[n][i] <= W) {
            cout << i;
            return;
        }
    }
}

#line 2 "template.h"

#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define MOD (ll)(1e9+7)
#define all(x) (x).begin(),(x).end()
#define unique(x) x.erase(unique(all(x)), x.end())
#define INF32 ((1ull<<31)-1)
#define INF64 ((1ull<<63)-1)
#define inf (ll)1e18

#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second

const int mod = 998244353;

void solve();

int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    // cin.exceptions(cin.failbit);
    // int t; cin >> t;
    // while(t--)
        solve();
    cerr << "\nTime run: " << 1000 * clock() / CLOCKS_PER_SEC << "ms" << '\n';
    return 0;
}
#line 2 "Dp/Knapsack.h"

// 1 <= N <= 100, 1 <= W <= 1e5
// 1 <= wi <= W, 1 <= vi <= 1e9
void knapsack01() {
    int n, W; cin >> n >> W;
    vector<int> w(n+1), v(n+1);
    for (int i = 1; i <= n; i++) {
        cin >> w[i] >> v[i];
    }
    vector<vector<ll>> dp(n+1, vector<ll>(W+1));
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= W; j++) {
            dp[i][j] = dp[i-1][j];
            if (j-w[i] < 0) continue;
            dp[i][j] = max(dp[i][j], dp[i-1][j-w[i]] + v[i]);
        }
    }
    cout << dp[n][W];
}

// 1 <= N <= 100, 1 <= W <= 1e9
// 1 <= wi <= W, 1 <= vi <= 1e3
void knapsack02() {
    int n, W; cin >> n >> W;
    vector<int> w(n+1), v(n+1);
    for (int i = 1; i <= n; i++) {
        cin >> w[i] >> v[i];
    }
    vector<vector<ll>> dp(n+1, vector<ll>(1e5+1, 1e18));
    for (int i = 0; i <= n; i++) {
        dp[i][0] = 0;
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= 1e5; j++) {
            dp[i][j] = dp[i-1][j];
            if (j-v[i] < 0) continue;
            if (dp[i-1][j-v[i]] + w[i] <= W) {
                dp[i][j] = min(dp[i][j], dp[i-1][j-v[i]] + w[i]);
            }
        }
    }
    for (int i = 1e5; i >= 0; i--) {
        if (dp[n][i] <= W) {
            cout << i;
            return;
        }
    }
}

Back to top page