Submission #1188307

#	Time	Username	Problem	Language	Result	Execution time	Memory
1188307		alwaus424	Knapsack (NOI18_knapsack)	C++20	17 / 100	1095 ms	328 KiB

knapsack

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int S, N;
    cin >> S >> N;

    vector<ll> dp(S + 1, 0);

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

        for (int cnt = 1; cnt <= k; cnt++) {
            for (int j = S; j >= w; j--) {
                if (j >= cnt * w)
                    dp[j] = max(dp[j], dp[j - cnt * w] + 1LL * cnt * v);
            }
        }
    }

    cout << *max_element(dp.begin(), dp.end()) << "\n";
    return 0;
}

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