题解 | #【模板】多重背包#

不开long long见祖宗。

#include <iostream>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <numeric>
#include <ctime>
#include <string>
#include <bitset>
#include <unordered_map>
#include <unordered_set>

using namespace std;
using ll = long long;

const ll N = 3e6 + 5, mod = 1e9 + 7, inf = 2e18;
const double esp = 1e-8;

ll dp[N], vv[N], ww[N];

void solve() {
    ll n, m;
    cin >> n >> m;
    memset(dp, 0, sizeof(dp));

    int num = 1;
    for (int i = 1; i <= n; i++) {
        int w, v, s;
        cin >> w >> v >> s;

        for (int j = 1; j <= s; j <<= 1) {

            ww[num] = w * j;
            vv[num++] = v * j;
            s -= j;
        }

        if (s) {
            ww[num] = s * w;
            vv[num++] = s * v;
        }

    }

    for (int i = 1; i < num; i++) {
        for (int j = m; j >= ww[i]; j--) {
            dp[j] = max(dp[j], dp[j - ww[i]] + vv[i]);
        }
    }
    cout << dp[m] << '\n';
}

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

    int t = 1;
    cin >> t;

    while (t--) {

        solve();

    }

    return 0;
}