Submission #693400

#	Time	Username	Problem	Language	Result	Execution time	Memory
693400		vjudge1	Knapsack (NOI18_knapsack)	C++17	49 / 100	224 ms	262144 KiB

knapsack

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

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

    int W, n;
    cin >> W >> n;
    vector<array<long long, 2>> a; // { (value, weight) }
    vector<vector<array<int, 2>>> mp(W + 1);

    for (int i = 0; i < n; i++) {
        int v, w, cnt;
        cin >> v >> w >> cnt;
        mp[w].push_back({v, cnt});
    }

    for (int w = 1; w <= W; w++) {
        sort(mp[w].begin(), mp[w].end(), greater<>());
        int needed = W / w;
        for (auto [v, cnt] : mp[w]) {
            for (int i = 0; i < min(needed, cnt); i++) {
                a.push_back({v, w});
            }
            needed -= cnt;
        }
    }

    n = a.size();

    vector<long long> dp(W + 1, 0);

    for (int i = 1; i <= n; i++) {
        for (int w = W; w >= a[i - 1][1]; w--) {
            dp[w] = max( dp[w], dp[w - a[i - 1][1]] + a[i - 1][0] );
        }
    }

    long long ans = 0;
    for (int w = 0; w <= W; w++) {
        ans = max(ans, dp[w]);
    }

    cout << ans << "\n";
}

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