제출 #990236

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
990236		aaaaaarroz	Knapsack (NOI18_knapsack)	C++17	100 / 100	83 ms	5324 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve() {
    ll s, n;
    cin >> s >> n;
    vector<vector<pair<ll, ll>>> w(s + 5);
    for (int i = 0; i < n; ++i) {
        ll v, we, k;
        cin >> v >> we >> k;
        w[we].push_back({v, k});
    }
 
    vector<pair<ll, ll>> v;
    for (int i = 0; i < s + 2; ++i) {
        if (w[i].empty()) continue;
        sort(w[i].begin(), w[i].end());
        ll ct = (s + i - 1) / i;
        for (; !w[i].empty() && ct > 0; --ct) {
            w[i].back().second--;
            v.push_back({i, w[i].back().first});
            if (w[i].back().second == 0) w[i].pop_back();
        }
    }
 
    vector<ll> dp(s + 10, 0);
    dp[0] = 0;
    for (auto &item : v) {
        for (int j = s + 5; j >= item.first; --j) {
            dp[j] = max(dp[j], dp[j - item.first] + item.second);
        }
    }
 
    ll res = 0;
    for (int i = 0; i <= s; ++i) {
        res = max(res, dp[i]);
    }
    cout << res << endl;
}
 
int main() {
    solve();
    return 0;
}

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