Submission #1175434

#	Time	Username	Problem	Language	Result	Execution time	Memory
1175434		FZ_Laabidi	Knapsack (NOI18_knapsack)	C++20	73 / 100	1094 ms	18984 KiB

knapsack

#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
    int s, n; cin >> s >> n;
    vector<int> v(n), w(n), k(n);
    for(int i=0; i<n; i++){
        cin >> v[i] >> w[i] >> k[i];
        k[i]= min(k[i], 2000LL);
    }
    vector<int> weight, value;
    for(int i=0; i<n; i++){
        int opt = k[i];
        for(int x =1; x<=opt; x*=2) {
            value.push_back(x*v[i]);
            weight.push_back(x*w[i]);
            opt -= x;
        }
        if(opt>0) {            
            value.push_back(opt*v[i]);
            weight.push_back(opt*w[i]);
        }
    }
    //for(int i: weight)cout << i << " ";
   // cout << endl;
    //for(int i: value)cout << i << " ";
    vector<int> dp(1e5, 0);
    for(int i=0; i<value.size(); i++){
        for(int j =(int)8e3; j>=weight[i]; j--){
            dp[j]= max(dp[j], dp[j-weight[i]]+value[i]);
        }
    }



    cout << dp[s]<< endl;
}

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