제출 #807508

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
807508		vjudge1	Knapsack (NOI18_knapsack)	C++17	100 / 100	68 ms	7392 KiB

knapsack

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

#define int long long
#define fast_io                       \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL);

signed main() {
    fast_io;

    int s, n;
    cin >> s >> n;

    vector<array<int, 3>> v(n);
    for (auto& i : v) cin >> i[0] >> i[1] >> i[2];

    vector<vector<array<int, 2>>> bywt(s + 1);

    for (auto i : v) bywt[i[1]].push_back({i[0], i[2]});
    for (auto& i : bywt) sort(i.begin(), i.end(), greater<>());

    vector<array<int, 2>> items;

    for (int wt = 1; wt <= s; wt++) {
        int take = s / wt;

        for (auto i : bywt[wt]) {
            int cnt = min(take, i[1]);
            for (int j = 0; j < cnt; j++) items.push_back({i[0], wt});
            take -= cnt;
            if (take == 0) break;
        }
    }

    vector<int> dp(s + 1);

    for (int i = 0; i < (int)items.size(); i++) {
        for (int wt = s; wt >= items[i][1]; wt--) {
            dp[wt] = max(dp[wt], dp[wt - items[i][1]] + items[i][0]);
        }
    }

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

    return 0;
}

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