Submission #970729

#	Time	Username	Problem	Language	Result	Execution time	Memory
970729		54skyxenon	Knapsack (NOI18_knapsack)	C++17	12 / 100	1 ms	348 KiB

knapsack

// https://oj.uz/problem/view/NOI18_knapsack

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

#define int long long

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int s, n;
    cin >> s >> n;

    vector<tuple<int, int, int>> items;
    for (int i = 0; i < n; i++) {
        int v, w, k;
        cin >> v >> w >> k;
        items.push_back({v, w, k});
    }

    vector<int> past_dp(s + 1);

    for (int i = 0; i < n; i++) {
        auto [v, w, k] = items[i];
        vector<int> dp(s + 1);

        for (int j = 1; j <= s; j++) {
            for (int repeat = 1; (repeat <= k) && (repeat * w <= j); repeat++) {
                dp[j] = max(dp[j], repeat * v + past_dp[j - repeat * w]);
            }
        }

        past_dp = max(past_dp, dp);
    }

    cout << past_dp[s] << '\n';
}

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