Submission #1333466

#	Time	Username	Problem	Language	Result	Execution time	Memory
1333466		isaacsun	Knapsack (NOI18_knapsack)	C++20	73 / 100	1095 ms	440 KiB

knapsack

// Source: https://usaco.guide/general/io

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
	
    int maxWeight, items;
    cin >> maxWeight >> items;

    vector<int> dp(maxWeight + 1);

    for(int i = 0; i < items; i++) {
        int value, weight, quantity;
        cin >> value >> weight >> quantity;

        for(int i = maxWeight; i >= weight; i--) {
            int maxValue = 0;
            for(int j = 0; j <= quantity; j++) {
                if(i - weight * j < 0) {
                    break;
                }
                maxValue = max(maxValue, dp[i - weight * j] + value * j);
            }
            dp[i] = maxValue;
        }
    }

    cout << dp[maxWeight];
}

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