Submission #1222096

#	Time	Username	Problem	Language	Result	Execution time	Memory
1222096		eduardmm	Knapsack (NOI18_knapsack)	C++20	12 / 100	0 ms	332 KiB

knapsack

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

int main(){

    cin.tie(0)->sync_with_stdio(0);

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

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

    vector<ll> dp(s + 1);
    for (int i = 0; i < n; ++i){
        vector<ll> temp(s + 1);
        for (int j = 0; j <= s; ++j){
            if (j == 0 || dp[j] > 0){
                if (j + w[i] <= s && dp[j + w[i]] < dp[j] + v[i] && temp[j] < k[i]){
                    temp[j + w[i]] += temp[j] + 1;
                    dp[j + w[i]] = dp[j] + v[i];
                }
            }
        }
    }

    ll ans = 0;
    for (int i = 1; i <= s; ++i) ans = max(ans, dp[i]);
    cout << ans << '\n';

    return 0;
}

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