Submission #1278204

#	Time	Username	Problem	Language	Result	Execution time	Memory
1278204		1an	Knapsack (NOI18_knapsack)	C++20	37 / 100	9 ms	1864 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;

#define int long long

int32_t main  () {
    int s, n;
    cin >> s >> n;

    vector<int> v(n), w(n), k(n);
    for (int i = 0; i < n; i++)
        cin >> v[i] >> w[i] >> k[i];

    vector<vector<int>> dp(n, vector<int>(2005));

    for (int i = 1; i <= min(s / w[0], k[i]); i++)
        dp[0][i * w[0]] = i * v[0];

    for (int i = 1; i < n; i++) {
        dp[i][0] = 0; // base case
        for (int j = 0; j <= s; j++) {
            dp[i][j] = dp[i - 1][j];
            for (int t = 1; t <= min(j / w[i], k[i]); t++) {
                dp[i][j] = max(dp[i][j], dp[i - 1][j - w[i] * t] + v[i] * t);
            }
        }
    }

    int res = 0;
    for (int i = 0; i <= s; i++)
        res = max(res, dp[n - 1][i]);

    printf("%lld\n", res);
}

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