Submission #1067487

#	Time	Username	Problem	Language	Result	Execution time	Memory
1067487		rohanjha	Knapsack (NOI18_knapsack)	C++14	37 / 100	1072 ms	428 KiB

knapsack

#include<iostream>
#include<vector>
using namespace std;
int main(){
    int s, n;
    cin>>s>>n;
    vector<vector<int> > items;
    for(int i=0; i<n; i++){
        int v, w, k;
        cin>>v>>w>>k;
        vector<int> item;
        item.push_back(v);
        item.push_back(w);
        item.push_back(k);
        items.push_back(item);
    }
   
    vector<int> dp(s+1, 0);
    for(int i=0; i<n; i++){
        for(int j=s; j>=items[i][1]; j--){
            for(int k=1; k<=items[i][2]; k++){
                if(j>=k*items[i][1]){
                    dp[j] = max(dp[j], dp[j-k*items[i][1]]+k*items[i][0]);
                }
            }
        }
    }
    std::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