Submission #944836

#	Time	Username	Problem	Language	Result	Execution time	Memory
944836		ezzzay	Knapsack (NOI18_knapsack)	C++14	37 / 100	1061 ms	7516 KiB

knapsack

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pb push_back
const int N=3e5+2;
int dp[N];
int v[N],w[N],k[N];
signed main(){
    int s,n;
    cin>>s>>n;
    for(int i=1;i<=n;i++){
        cin>>v[i]>>w[i]>>k[i];
    }
    for(int i=0;i<N;i++)dp[i]=-1;
    dp[0]=0;
    for(int i=1;i<=n;i++){
        for(int p=0;p<k[i];p++){
            for(int j=s;j>=w[i];j--){
                if(dp[j-w[i]]!=-1){
                    dp[j]=max(dp[j],dp[j-w[i]]+v[i]);
                }
            }
        }
        
    }
    int ans=0;
    for(int i=0;i<N;i++)ans=max(ans,dp[i]);
    cout<<ans;
}

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