Submission #1162087

#	Time	Username	Problem	Language	Result	Execution time	Memory
1162087		Ciprian	Knapsack (NOI18_knapsack)	C++20	73 / 100	128 ms	327680 KiB

knapsack

#include <iostream>
#include <vector>

using namespace std;
#define int long long 
int dp[(int)1e5+5][(int)2005];
int v[(int)1e5+5],w[(int)1e5+5],k[(int)1e5+5];
int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int s,n;
    cin>>s>>n;
    
    for(int i=1; i<=n; i++){
        cin>>v[i]>>w[i]>>k[i];
        
    }int mx=0;
    
    for(int i=1; i<=n; i++){
        for(int j=0; j<=s; j++){
            dp[i][j]=dp[i-1][j];
            int x=1;
            while(x<=k[i] && x*w[i]<=j){
                dp[i][j]=max(dp[i][j], dp[i-1][j-x*w[i]]+x*v[i]);
                x++;
            }
            mx=max(mx, dp[i][j]);
        }
    }cout<<mx<<endl;
    
    
    return 0;
}

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