Submission #963221

#	Time	Username	Problem	Language	Result	Execution time	Memory
963221		biank	Knapsack (NOI18_knapsack)	C++14	37 / 100	1 ms	604 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    
    int n, s;
    cin >> s >> n;
    vector<int> v(n), w(n), k(n);
    for (int i = 0; i < n; i++) {
        cin >> v[i] >> w[i] >> k[i];
    }
    vector<int> dp(s + 1, 0);
    auto add = [&](int p, int c) {
        for (int i = s; i >= c; i--) {
            dp[i] = max(dp[i], dp[i - c] + p);
        }
    };
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < 30; j++) {
            if (1 << j <= k[i]) {
                add(v[i] << j, w[i] << j);
                k[i] -= 1 << j;
            }
        }
        if (k[i] > 0) add(v[i] * k[i], w[i] * k[i]);
    }
    cout << dp[s] << '\n';
    
    return 0;
}

• Subtask 1: 0 / 12
• Subtask 2: 17 / 17
• Subtask 3: 20 / 20
• Subtask 4: 0 / 24
• Subtask 5: 0 / 27