Submission #1033290

#	Time	Username	Problem	Language	Result	Execution time	Memory
1033290		vjudge1	Knapsack (NOI18_knapsack)	C++17	73 / 100	1033 ms	600 KiB

knapsack

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

#define int long long

void solve() {
    int s, n;
    cin >> s >> n;
    vector<int> dp(s + 1, 0);

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

        for (int b = 1; k > 0; b *= 2) {
            int num = min(b, k);
            k -= num;
            int tv = num * v;
            int tw = num * w;

            for (int j = s; j >= tw; j--) {
                dp[j] = max(dp[j], dp[j - tw] + tv);
            }
        }
    }

    cout << *max_element(dp.begin(), dp.end()) << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

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