Submission #986129

#	Time	Username	Problem	Language	Result	Execution time	Memory
986129		shokal_kishan	Knapsack (NOI18_knapsack)	C++17	73 / 100	1036 ms	7164 KiB

knapsack

#include<bits/stdc++.h>
using namespace std;
#define int long long 
 
 
void solve(){
 
    int s,n; cin>>s>>n;
    vector<vector<int>>arr(n,vector<int>(3,0));
    for(int i=0; i<n;i++){
        int v,w,k; cin>>v>>w>>k;
        arr[i][0] = v ;
        arr[i][1] = w ;
        arr[i][2] = k ;
    }
    vector<int>dp(s+1,0);
    for(int i=0;i<n;i++){
        for(int k =0;k<arr[i][2];k++){
            if((k+1)*arr[i][1]>s) break;
            for(int j=s;j>=arr[i][1];j--){
                dp[j] = max( dp[j],dp[j-arr[i][1]]+arr[i][0]);
            }
        }
    }
    cout<<dp[s]<<endl;
 
 
}
 
int32_t main(){
    int t=1; //cin>>t;
    while(t--) solve();
}

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