Submission #478011

#	Time	Username	Problem	Language	Result	Execution time	Memory
478011		pavanscoding	Knapsack (NOI18_knapsack)	C++17	37 / 100	1091 ms	1100 KiB

knapsack

#include <algorithm>
#include <bits/stdc++.h>
#include <cstring>
using namespace std;

const int mod=1e9+7;
int dp[100001][2001],s,n,v[100001],w[100001],k[100001];

int main(){
    cin.tie(0)->sync_with_stdio(0);
    cin >> s >> n;
    for(int i=1;i<=n;i++)
        cin >> v[i] >> w[i] >> k[i];
    for(int i=1;i<=n;i++){
        for(int j=0;j<=s;j++){
            for(int t=0;t<=k[i];t++){
                if(j>=t*w[i])
                    dp[i][j]=max(dp[i][j],dp[i-1][j-t*w[i]]+t*v[i]);
            }
        }
    }
    cout << dp[n][s];
}

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