제출 #1014229

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1014229		aufan	Knapsack (NOI18_knapsack)	C++17	100 / 100	34 ms	4956 KiB

knapsack

#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second

using namespace std;

int32_t main()
{
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        
        int s, n;
        cin >> s >> n;

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

                br[w].push_back({v, k});
        }
        
        vector<int> dp(s + 1);
        for (int i = 1; i <= s; i++) {
                sort(br[i].rbegin(), br[i].rend());

                vector<int> vals;
                for (auto [x, c] : br[i]) {
                        for (int j = 0; j < c; j++) {
                                vals.push_back(x);
                                if ((int)vals.size() * i > s) break;
                        }

                        if ((int)vals.size() * i > s) break;
                }

                int sum = 0;
                vector<int> ndp = dp;
                for (int j = 0; j < (int)vals.size(); j++) {
                        sum += vals[j];
                        for (int l = (j + 1) * i; l <= s; l++) {
                                ndp[l] = max(ndp[l], dp[l - (j + 1) * i] + sum);
                        }
                }

                swap(dp, ndp);
        }

        int ans = 0;
        for (int i = 0; i <= s; i++) ans = max(ans, dp[i]);

        cout << ans << '\n';
        
        return 0;
}

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