Submission #732034

#	Time	Username	Problem	Language	Result	Execution time	Memory
732034		manhtuan22007	Knapsack (NOI18_knapsack)	C++14	100 / 100	60 ms	5000 KiB

knapsack

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


int n , s , dp[2005];
vector<pair<int , int>> a[2005];

int32_t main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin >> s >> n;

    for(int i = 1 ; i <= n ; i ++){
        int v , w , k;
        cin >> v >> w >> k;
        a[w].push_back({v , k});
//        s[w] += k;
    }
    for(int i = 1 ; i <= s ; i ++){
        if(!a[i].empty()) sort(a[i].begin() , a[i].end() , greater<pair<int , int>>());
    }
    for(int i = 1 ; i <= s ; i ++){
        if(a[i].empty()) continue;
        int ind = 1 , sum = 1 , j = 1;
        while(sum <= s / i && ind <= (int)a[i].size()){
            if(a[i][ind - 1].second < j){
                ++ind;
                j = 1;
            }
            if(ind > (int)a[i].size()) continue;
            for(int c = s ; c >= i ; c --){
                dp[c] = max(dp[c] , dp[c - i] + a[i][ind - 1].first);
            }
            ++sum , ++j;
        }
    }
    cout << dp[s];
}

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