Submission #1020159

#	Time	Username	Problem	Language	Result	Execution time	Memory
1020159		ArthuroWich	Knapsack (NOI18_knapsack)	C++17	37 / 100	1056 ms	384 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
#define int long long int
void solve() {
    int s, n;
    cin >> s >> n;
    vector<int> dp(s+1, -1);
    dp[0] = 0;
    for (int i = 0; i < n; i++) {
        int v, w, k;
        cin >> v >> w >> k;
        for (int x = 1; x <= k; x++) {
            for (int j = s; j >= 0; j--) {
                if (j-w < 0) {
                    break;
                }
                if (dp[j-w] != -1) {
                    dp[j] = max(dp[j], dp[j-w]+v);
                } 
            }
        }
    }
    int ans = 0;
    for (int i : dp) {
        ans = max(ans, i);
    }
    cout << ans << endl;
}
int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    t = 1;
    while(t--) {
        solve();
    }
}

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