Submission #756477

#	Time	Username	Problem	Language	Result	Execution time	Memory
756477		asdasdqwer	Knapsack (NOI18_knapsack)	C++14	100 / 100	135 ms	3788 KiB

knapsack

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

int main() {
    int s, n;

    cin >> s >> n;
    vector<int64_t> dp(s+1, 0);
    vector<int> div(s+1);

    if (n == 1) {
        int64_t v, w, k;
        cin >> v >> w >> k;

        int times = min(s / w, k);
        cout << v * times << "\n";
        return 0;
    }

    // calculate div
    for (int i = 1; i <= s; i++) {
        div[i] = s / i;
    }

    vector<vector<int>> value(s+1);
    vector<vector<pair<int,int>>> pairs(s+1, vector<pair<int,int>>());
    for (int i = 0; i < n; i++) {
        int v, w, k;
        cin >> v >> w >> k;

        int m = min(div[w], k);
        pairs[w].push_back(make_pair(v, m));
    }

    for (int i = s; i > 0; i--) {
        sort(pairs[i].begin(), pairs[i].end(), greater<pair<int, int>>());
        int c = 0, pos = 0;
        value[i] = vector<int>(div[i], 0);
        int size = pairs[i].size();
        while ((c < div[i]) && (pos < size)) {
            for (int j = 0; j < pairs[i][pos].second && c < div[i]; j++) {
                value[i][c] = pairs[i][pos].first;
                c++;
            }
            pos++;
        }
    }

    for (int i = s; i > 0; i--) {
        for (int j = 0; j < div[i]; j++) {
            for (int k = s; k >= i; k--) {
                if (dp[k] < dp[k - i] + value[i][j]) {
                    dp[k] = max(dp[k], dp[k - i] + value[i][j]);
                }
            }
        }
    }

    cout << dp[s] << "\n";
}

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