Submission #508740

#	Time	Username	Problem	Language	Result	Execution time	Memory
508740		bshen	Knapsack (NOI18_knapsack)	C++17	73 / 100	280 ms	2160 KiB

knapsack

#include <iostream>
#include <vector>

using namespace std;

int s, n, v[100001], w[10001], k[100001];
long long best=0;
long long dp[2001];

int main() {
    cin >> s >> n;
    for (int i=0; i<n; i++) {
        cin >> v[i] >> w[i] >> k[i];
        k[i] = min(k[i], s/w[i]);
    }
    for (int i=0; i<n; i++) {
        for (int j=0; j<k[i]; j++) {
            for (int we=s; we>=0; we--) {
                if (we-w[i] >=0) dp[we] = max(dp[we], dp[we-w[i]] + 1ll*v[i]);
                best = max(best, dp[we]);
            }
        }
    }
    cout << best << endl;
}

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