Submission #1215867

#	Time	Username	Problem	Language	Result	Execution time	Memory
1215867		muhammadali_2009	Knapsack (NOI18_knapsack)	C++20	100 / 100	40 ms	2884 KiB

knapsack

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

int s, n, v, w, k;
vector<pair<int,int>> a[2001];
int dp[2001], ans;

int32_t main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> s >> n;
    for(int i = 0; i < n; i++){
        cin >> v >> w >> k;
        a[w].emplace_back(v, k);
    }

    for(int i = 1; i <= s; i++){
        auto &g = a[i];
        sort(g.begin(), g.end(), greater<>());
        int idx = 0;
        for(int cnt = 0; cnt < s / i; cnt++){
            if(idx >= (int)g.size()) break;
            for(int j = s; j >= i; j--){
                dp[j] = max(dp[j], dp[j - i] + g[idx].first);
                ans   = max(ans, dp[j]);
            }
            if(--g[idx].second == 0) idx++;
        }
    }

    cout << ans;
}

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