제출 #1136832

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1136832		b1t_exe	Knapsack (NOI18_knapsack)	C++20	73 / 100	1095 ms	5892 KiB

knapsack

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int t = 1; // Number of test cases
    while (t--) {
        int x, n;
        cin >> x >> n; // Maximum weight capacity and number of items
        vector<vector<int>> arr(n, vector<int>(3)); // Item details: value, weight, max quantity

        for (int i = 0; i < n; i++) {
            cin >> arr[i][0]; // Value of item
            cin >> arr[i][1]; // Weight of item
            cin >> arr[i][2]; // Maximum quantity of item
        }

        vector<int> dp(x + 1, 0); // DP array to store max profit for each capacity

        // Process each item
        for (int i = 0; i < n; i++) {
            int value = arr[i][0];
            int weight = arr[i][1];
            int maxQuantity = arr[i][2];

            // Process for bounded quantity
            for (int capacity = x; capacity >= weight; capacity--) {
                for (int quantity = 1; quantity <= maxQuantity && quantity * weight <= capacity; quantity++) {
                    dp[capacity] = max(dp[capacity], quantity * value + dp[capacity - quantity * weight]);
                }
            }
        }

        cout << dp[x] << endl; // Maximum profit for capacity x
    }

    return 0;
}

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