Submission #891720

#	Time	Username	Problem	Language	Result	Execution time	Memory
891720		a5a7	Knapsack (NOI18_knapsack)	C++14	73 / 100	1069 ms	1416 KiB

knapsack

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

int main(){
    int s, n;
    cin >> s >> n;
    vector<int> val(s+1, -1);
    val[0] = 0;
    for (int i = 0; i < n; i++){
        int v, w, k;
        cin >> v >> w >> k;
        k = min(k, s/w);
        for (int j = s; j > -1; j--){
            for (int x = 1; x * w <= j && x <= k; x++){
                if (val[j-x*w] == -1) continue;
                val[j] = max(val[j-x*w]+x*v, val[j]);
            }
        }
    }
    cout << (*max_element(val.begin(), val.end())) << endl;
}

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