Submission #1258231

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

knapsack

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

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int S, N;
    cin >> S >> N;
    vector<int> dp(S + 1, 0);

    for (int i = 0; i < N; ++i) {
        int v, w, k;
        cin >> v >> w >> k;
        // Бинарное разбиение количества
        for (int p = 1; k > 0; p <<= 1) {
            int take = min(p, k);
            for (int j = S; j >= w * take; --j) {
                dp[j] = max(dp[j], dp[j - w * take] + v * take);
            }
            k -= take;
        }
    }

    cout << *max_element(dp.begin(), dp.end()) << endl;
    return 0;
}

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