Submission #1129148

#	Time	Username	Problem	Language	Result	Execution time	Memory
1129148		idkfr	Knapsack (NOI18_knapsack)	C++20	37 / 100	1 ms	328 KiB

knapsack

#include<bits/stdc++.h>

using namespace std;

int main() {
    int n, W;
    cin >> W >> n;

    vector<long long> dp(W + 1, 0);

    for (int i = 0; i < n; ++i) {
        int wi, vi, ai;
        cin >> vi >> wi >> ai;

        for (int k = 1; ai > 0; k *= 2) {
            int num = min(k, ai);
            ai -= num;
            int weight = num * wi;
            int value = num * vi;

            for (int j = W; j >= weight; --j) {
                dp[j] = max(dp[j], dp[j - weight] + value);
            }
        }
    }

    cout << dp[W] << endl;

    return 0;
}

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