Submission #1198853

#	Time	Username	Problem	Language	Result	Execution time	Memory
1198853		ericl23302	Knapsack (NOI18_knapsack)	C++20	100 / 100	34 ms	2840 KiB

knapsack

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

#define int long long

using namespace std;

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int s, n; cin >> s >> n;
    vector<int> dp(s + 1, 0);
    vector<vector<pair<int, int>>> items(s);
    while (n--) {
        int v, w, k; cin >> v >> w >> k;
        items[w - 1].emplace_back(v, k);
    }
    for (int i = 1; i <= s; ++i) {
        auto &lst = items[i - 1];
        sort(lst.rbegin(), lst.rend());
        int cur = 0;
        for (auto &[v, k] : lst) {
            if (cur >= s / i) break;
            for (int j = 0; j < min(k, s / i - cur); ++j) {
                for (int a = s; a >= i; --a) dp[a] = max(dp[a], dp[a - i] + v);
            }
            cur += k;
        }
    }

    int res = 0;
    for (int i : dp) res = max(res, i);
    cout << res << '\n';

    return 0;
}

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