Submission #1111706

#	Time	Username	Problem	Language	Result	Execution time	Memory
1111706		slycelote	Knapsack (NOI18_knapsack)	C++17	73 / 100	1078 ms	1468 KiB

knapsack

#include <iostream>
#include <vector>

using namespace std;

int main() {
    cin.tie(0); iostream::sync_with_stdio(false);
    int s, n; cin >> s >> n;
    vector<int> best(s+1);
    while (n--) {
        int v, w, k; cin >> v >> w >> k;
        k = min(k, s / w);
        while (k--) {
            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: 0 / 27