Submission #470666

#	Time	Username	Problem	Language	Result	Execution time	Memory
470666		Darthspartan	Knapsack (NOI18_knapsack)	C++17	0 / 100	116 ms	262148 KiB

knapsack

#include <iostream>
#include <bits/stdc++.h>

using namespace std;

vector<int> value;
vector<int> weight;
vector<int> copies;
vector<long long> ans (4e3+4,-1);
vector<vector<int>> copiesdp(1e5+5, vector<int>(4e3+3));

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n, x;
    cin >> x >> n;

    for(int i=0;i<n;i++){
        int a,b,c;
        cin >> a >> b >> c;
        value.push_back(a);
        weight.push_back(b);
        copies.push_back(c);
    }

    ans[0]=0;
    for(int i=0;i<n;i++){
        for(int j=0;j<=x;j++){
            if(copiesdp[i][j]==copies[i])
                continue;

            if(ans[j+weight[i]]<=ans[j]+value[i]){
                ans[j+weight[i]]=ans[j]+value[i];
                copiesdp[i][j+weight[i]]=copiesdp[i][j]+1;
            }
        }
    }

    cout << *(max_element(ans.begin(),ans.begin()+x+1));
    return 0;
}

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