Submission #1231730

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

knapsack

#include <bits/stdc++.h>
using namespace std;

const int MAXS = 2005;
int dp[MAXS];

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

    int S, N;
    cin >> S >> N;

    vector<pair<int, int>> items; // (value, weight)

    for (int i = 0; i < N; i++) {
        int v, w, k;
        cin >> v >> w >> k;

        // Binary decomposition of count k
        for (int j = 1; k > 0; j <<= 1) {
            int take = min(j, k);
            items.emplace_back(v * take, w * take);
            k -= take;
        }
    }

    // Classic 0/1 Knapsack with expanded items
    for (auto [val, wt] : items) {
        for (int s = S; s >= wt; s--) {
            dp[s] = max(dp[s], dp[s - wt] + val);
        }
    }

    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