Submission #985656

#	Time	Username	Problem	Language	Result	Execution time	Memory
985656		vjudge1	Knapsack (NOI18_knapsack)	C++17	37 / 100	1 ms	604 KiB

knapsack

#include <bits/stdc++.h>
using i64 = long long;

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

    int S, N;
    std::cin >> S >> N;

    std::vector<int> dp(1 + S);

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

        for (int c = 1; c <= k; c *= 2) {
            for (int j = S - w * c; j >= 0; j--) {
                dp[j + w * c] = std::max(dp[j + w * c], dp[j] + v * c);
            }
            k -= c;
        }
        if (k) {
            for (int j = S - w * k; j >= 0; j--) {
                dp[j + w * k] = std::max(dp[j + w * k], dp[j] + v * k);
            }
        }
    }
    
    std::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