제출 #1192588

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1192588		dprto	Knapsack (NOI18_knapsack)	C++20	100 / 100	37 ms	3912 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define x first
#define y second
#define MASK(i) (1 << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
#define f(i, l, r) for(int i = l; i <= r; ++i)
const int mod = 1e9 + 7;
const int ars = 1e5 + 5;
const ll infll = 1e18;


int s, n, dp[ars];
vector<pair<int, int>> wei[ars];
signed main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> s >> n;

    for(int i = 1; i <= n; ++i){
        int v, w, k;
        cin >> v >> w >> k;
        if(w > s) continue;
        wei[w].push_back({v, k});
    }

    for(int i = 1; i <= s; ++i) dp[i] = -1e9;
    dp[0] = 0;

    for(int w = 1; w <= s; ++w){
        sort(wei[w].begin(), wei[w].end(), greater<>());
    }

    for(int w = 1; w <= s; ++w){
        if(wei[w].empty()) continue;

        vector<int> items;
        int limit = s / w;
        for(auto [val, cnt] : wei[w]){
            int take = min(cnt, limit);
            limit -= take;
            while(take--) items.push_back(val);
            if(limit == 0) break;
        }

        for(int v : items){
            for(int i = s; i >= w; --i){
                if(dp[i - w] != -1e9){
                    dp[i] = max(dp[i], dp[i - w] + v);
                }
            }
        }
    }

    int res = 0;
    for(int i = 1; i <= s; ++i){
        res = max(res, dp[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