제출 #1347747

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1347747		dkasabovn	Knapsack (NOI18_knapsack)	C++20	37 / 100	1095 ms	344 KiB

knapsack

#include <bits/stdc++.h>

#define MOD 1000000007

using namespace std;


int main(void) {
    int s, n;
    cin >> s >> n;

    vector<int> values(n);
    vector<int> weights(n);
    vector<int> amounts(n);

    for (int i = 0; i < n; i++) {
        cin >> values[i];
        cin >> weights[i];
        cin >> amounts[i];
    }

    vector<int> dp(s+1, 0);
    dp[0] = 0;

    // 2 4 6
    // 3 5 7

    for (int i = 0; i < n; i++) {
        auto value = values[i];
        auto weight = weights[i];

        for (int j = s; j >= 0; j--) {
            auto amount = amounts[i];
            while (amount > 0) {
                if (j >= weight * amount) { 
                    dp[j] = max(dp[j], dp[j - amount * weight] + value * amount);
                }
                amount--;
            }
        }
    }

    cout << dp[s];
}

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