Submission #986224

#	Time	Username	Problem	Language	Result	Execution time	Memory
986224		vjudge1	Knapsack (NOI18_knapsack)	C++17	100 / 100	61 ms	3776 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 item(1 + S, std::vector<std::tuple<int, int>>());
    for (int i = 0; i < N; i++) {
        int v, w, k;
        std::cin >> v >> w >> k;

        item[w].push_back({v, k});
    }

    std::vector<int> dp(1 + S);
    for (int w = 1; w <= S; w++) {
        if (item[w].empty()) {
            continue;
        }

        std::sort(item[w].begin(), item[w].end(), std::greater<std::tuple<int, int>>());
        for (int j = S; j >= 0; j--) {
            [&]{
                int c = 0, val = 0;
                for (auto [v, k] : item[w]) {
                    for (int i = 0; i < k; i++) {
                        val += v, c++;
                        if (j + c * w > S) {
                            return;
                        }
                        dp[j + c * w] = std::max(dp[j + c * w], dp[j] + val);
                    }
                }
            }();
        }
    }
    std::cout << dp[S] << "\n";

    return 0;
}

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