제출 #956266

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
956266		haileyy	Knapsack (NOI18_knapsack)	C++14	37 / 100	1035 ms	348 KiB

knapsack

//https://oj.uz/problem/view/NOI18_knapsack
#include <bits/stdc++.h>

#define loop(i, l, r) for(int i = (l); i < (r); ++i)
#define pool(i, l, r) for(int i = (l); i > (r); --i)
#define debug(x) cerr << #x << ": " << x << endl;
using namespace std;
int n,s;
const int MAXS = 2005;
long long dp[MAXS];
map<int,vector<pair<int,int>>> items;
bool cmp(pair<int,int> a,pair<int,int> b){
    return a.first>b.first;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>s>>n;
    long long v,w,k;
    loop(i,0,n){
        cin>>v>>w>>k;
        items[w].push_back({v,k});
    }
    for(auto i:items){
        vector<pair<int,int>> a = i.second;
        sort(a.begin(),a.end(),cmp);
        int b = 0;
        for(auto j:a){
            b+=j.second;
        }

        pool(j,s,-1){
            int value = 0;
            int c = 0;
            int count = 0;
            loop(l,1,b+1){
                w = l*i.first;
                if(j>=w){
                    value+=a[c].first;
                    count++;
                    if(count>=a[c].second){
                        c++;
                        count = 0;
                    }
                    dp[j] = max(dp[j],dp[j-w]+value);
                }
            }
        }
    }
    cout<<dp[s]<<endl;
    return 0;
}

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