Submission #1258236

#	Time	Username	Problem	Language	Result	Execution time	Memory
1258236		alizhan	Knapsack (NOI18_knapsack)	C++20	73 / 100	1096 ms	1472 KiB

knapsack

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

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int s, n;
    cin >> s >> n;
    vector<pair<int,int>> g[2001];  

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

    vector<int> dp(s + 1, INT_MIN);
    dp[0] = 0;

    for(int w = 1; w <= s; w++) {
        if(g[w].empty()) continue;
        
        sort(g[w].begin(), g[w].end(), greater<pair<int,int>>());
        
        for(auto [v, k] : g[w]) {
            int mx = min(k, s / w);
            for(int x = 1; x <= mx; x++) {
                for(int j = s; j >= w; j--) {
                    if(dp[j - w] != INT_MIN) {
                        dp[j] = max(dp[j], dp[j - w] + v);
                    }
                }
            }
        }
    }
    int ans=0;
    for(int i=0;i<dp.size();i++){
        ans=max(ans,dp[i]);
    }
    cout << (ans == INT_MIN ? 0 : ans) << endl;
    
}

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