Submission #1111714

#	Time	Username	Problem	Language	Result	Execution time	Memory
1111714		slycelote	Knapsack (NOI18_knapsack)	C++17	100 / 100	51 ms	3708 KiB

knapsack

#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

int main() {
    cin.tie(0); iostream::sync_with_stdio(false);
    int s, n; cin >> s >> n;
    vector<vector<pair<int, int>>> que(s+1);
    while (n--) {
        int v, w, k; cin >> v >> w >> k;
        k = min(k, s / w);
        que[w].push_back(pair(v, k));
    }

    vector<int> best(s+1);
    for (int w = 1; w <= s; ++w) {
        auto& v = que[w];
        sort(v.begin(), v.end(), greater<>{});
        int rem = s/w;
        for (auto [v, k] : v) {
            if (!rem) {
                break;
            }
            for (; k && rem; k--, rem--) {
                for (int i = s-w; i >= 0; --i) {
                    auto& r = best[i+w];
                    r = max(r, best[i] + v);
                }
            }
        }
    }

    cout << best[s] << endl;
}

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