제출 #856568

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
856568		bad_ian	Knapsack (NOI18_knapsack)	C++17	37 / 100	1036 ms	600 KiB

knapsack

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

int main() {
    ll S, N;
    cin >> S >> N;

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

    for (int i = 0; i < N; i++) {
        ll V, W, K;
        cin >> V >> W >> K;

        // For each item type, we need to maximize the value for the given weight capacity
        for (int k = 1; k <= K; k++) {
            // We iterate in reverse order to avoid double counting items
            for (int s = S; s >= W; s--) {
                dp[s] = max(dp[s], dp[s - W] + V);
            }
        }
    }

    cout << dp[S] << endl;

    return 0;
}

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