Submission #1231729

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

knapsack

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

#define fastio ios_base::sync_with_stdio(false);cin.tie(0); cout.tie(0);
#define pb push_back

int main() {
    fastio

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

    vector<int> weights, values;

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

        // Binary decomposition
        for (int j = 1; k > 0; j <<= 1) {
            int cnt = min(j, k);
            weights.pb(cnt * w);
            values.pb(cnt * v);
            k -= cnt;
        }
    }

    // Standard 0/1 knapsack on decomposed items
    vector<int> dp(S + 1, 0);

    for (int i = 0; i < weights.size(); i++) {
        for (int j = S; j >= weights[i]; j--) {
            dp[j] = max(dp[j], dp[j - weights[i]] + values[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