Submission #1178409

#	Time	Username	Problem	Language	Result	Execution time	Memory
1178409		GoBananas69	Knapsack (NOI18_knapsack)	C++20	37 / 100	155 ms	327680 KiB

knapsack

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

using namespace std;
typedef long long ll;

int s, n;
vector<int> v, w, k;
vector<vector<int>> dp;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> s >> n;
    v.resize(n);
    w.resize(n);
    k.resize(n);
    for (int i = 0; i<n; ++i) {
        int a, b, m;
        cin >> a >> b >> m;
        for (int j = 0; j < m; ++j) {
            v.push_back(a);
            w.push_back(b);
        }
    }
    n = w.size();
    dp.resize(n + 1, vector<int>(s + 1, -1));
    for (int i = 0; i<n; ++i) {
        for (int j = 0; j<=s; ++j) {
            if (i == 0 || j == 0) {
                dp[i][j] = 0;
                continue;
            }
            if (w[i] > j) {
                dp[i][j] = dp[i - 1][j];
                continue;
            }
            dp[i][j] = max(
                dp[i - 1][j],
                v[i] + dp[i - 1][j - w[i]]
            );
        }
    }
    cout << dp[n - 1][s] << '\n';
}

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