多重背包问题—二进制优化

#include <bits/stdc++.h>
#define bug cout << "***************" << endl
#define fuck(x) cout << #x << " -> " << x << endl
#define rep(i, num, e) for (int i = (num); i <= (e); i++)
#define dep(i, num, e) for (int i = (num); i >= (e); i--)
#define endl '\n'
#define int long long
using namespace std;
constexpr int N = 1e6 + 10, inf = 0x3f3f3f3f;
int v[N], w[N], s[N];
int dp[N];
void solve()
{
    int n, m;
    cin >> n >> m;
    int cnt = 0;
    for (int i = 1; i <= n; i++)
    {
        int a, b, c;
        cin >> a >> b >> c;
        int k = 1;
        while (k < c)
        {
            cnt++;
            v[cnt] = a * k;
            w[cnt] = b * k;
            s[cnt] = c * k;
            c -= k;
            k *= 2;
        }
        if (c)
        {
            cnt++;
            v[cnt] = a * c;
            w[cnt] = b * c;
            s[cnt] = c * c;
        }
    }
    n = cnt;
    for (int i = 1; i <= n; i++)
    {
        for (int j = m; j >= v[i]; j--)
        {
            dp[j] = max(dp[j], dp[j - v[i]] + w[i]);
        }
    }
    cout << dp[m] << endl;
}

signed main()
{
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int T = 1;
    while (T--)
    {
        solve();
    }
    return 0;
}