51Nod 1086 多重背包+二进制优化

二进制优化裸题

#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<vector>
#include<cstring>
#include<stack>

#define mem(ss) memset(ss,0,sizeof(ss))
#define rep(d, s, t) for(int d=s;d<=t;d++)
#define rev(d, s, t) for(int d=s;d>=t;d--)
#define inf 0x3f3f3f3f
typedef long long ll;
typedef long double ld;
typedef double db;
typedef std::pair<int, int> pii;
typedef std::pair<ll, ll> pll;
const ll mod = 1e9 + 7;
const int N = 1e2 + 10;
#define io_opt ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;

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

inline ll read() {
    ll x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-')f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    return x * f;
}

int n, m, p[N], c[N], w[N], dp[N * N * N];

int main() {
    n = read(), m = read();
    rep(i, 1, n)w[i] = read(), p[i] = read(), c[i] = read();

    for (int i = 1; i <= n; i++) {

        if( w[i] * c[i] >= m ) {
            for(int j = w[i]; j <= m; j++ )
                dp[j] = max(dp[j -w[i]] + p[i], dp[j]);
            continue;
        }
        for (int k = 1; k < c[i]; c[i] -= k, k <<= 1) {
            for (int j = m; j >= k * w[i]; j--)
                dp[j] = max(dp[j - k * w[i]] + k * p[i], dp[j]);
        }
        if (c[i])
            for (int j = m; j >= c[i] * w[i]; j--)
                dp[j] = max(dp[j - c[i] * w[i]] + c[i] * p[i], dp[j]);
    }
    cout << dp[m];
    return 0;
}