제출 #532708

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
532708		mihh	Knapsack (NOI18_knapsack)	C++17	100 / 100	155 ms	21208 KiB

knapsack

#include <bits/stdc++.h>
#define db(x) cerr << #x <<":"<<x<<"  "
using namespace std;

const int INF=1e9, MOD=1e9+7;
const int N=1e5+2;
typedef array<int,3>item ;

int main(){

    int n, kg; cin>>kg>>n;
    vector<item> a(n+1);
    unordered_map<int,vector<item>> byWeight;
    for(int i=1;i<=n;++i){
        cin>>a[i][0]>>a[i][1]>>a[i][2];
        byWeight[a[i][1]].push_back(a[i]);
        // auto[v,w,k]=a[i];
        //      0 1 2
    }
    int i=0;
    vector<vector<int>> bst(byWeight.size()+1,vector<int>(kg+1,INT32_MIN));
    bst[0][0]=0;
    for(auto &[w, itms]:byWeight){
        ++i;
        sort(itms.begin(), itms.end(), std::greater<item>());
        db(w);
        for(int j=0;j<=kg;++j){
            bst[i][j]=bst[i-1][j];
            int profit=0;
            for(int curr=0,r=1,currUsed=0; curr<(int)itms.size() and r*w<=j; ++r){
                profit+=itms[curr][0];
                ++currUsed;
                bst[i][j]=max(
                    bst[i][j],
                    bst[i-1][j-r*w]+profit
                              );
                if(currUsed==itms[curr][2]){
                    ++curr;
                    currUsed=0;
                }
            }
        }
    }
    int ans=0;
    for(int i=1;i<=kg;++i)
        ans=max(ans,bst[byWeight.size()][i]);
    cout<<ans;
}

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