Submission #1364335

#	Time	Username	Problem	Language	Result	Execution time	Memory
1364335		thisisadarsh	Knapsack (NOI18_knapsack)	C++20	73 / 100	1093 ms	2756 KiB

knapsack

#include <iostream>
#include <vector>
#include <array>
#include <cstdint>
using namespace std;

#define int int64_t

int32_t main() {
    int n, m;
    cin >> n >> m;

    vector<array<int,3>> a(m);
    for (int i = 0; i < m; i++) {
        cin >> a[i][0] >> a[i][1] >> a[i][2];
    }

    vector<int> dp(n + 1, 0);

    for (int i = 0; i < m; i++) {
        int value = a[i][0];
        int weight = a[i][1];
        int copies = a[i][2];

        for (int w = n; w >= 0; w--) {
            for (int k = 1; k <= copies; k++) {
                int need = k * weight;
                if (need > w) break;

                dp[w] = max(dp[w], dp[w - need] + k * value);
            }
        }
    }

    cout << dp[n] << '\n';
}

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