Submission #876136

#	Time	Username	Problem	Language	Result	Execution time	Memory
876136		CBG6682	Knapsack (NOI18_knapsack)	C++17	12 / 100	9 ms	12636 KiB

knapsack

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

const int MAXX = 1e5 + 5;
int s,n,v[MAXX],w[MAXX],dp[2001][MAXX],k[MAXX];
int main(){
    cin >> s >> n;
    for (int i = 0; i < n; i++) cin >> v[i] >> w[i] >> k[i];
    for (int i = 1; i <= s; i++){
        for (int j = 0; j < n; j++){
            if (i >= w[j]){
                int num = 1;
                while (num*w[j] <= i && num <= k[j]){
                    dp[i][j] = max(max(dp[i - num*w[j]][j - 1] + v[j]*num,dp[i][j]),max(dp[i - 1][j],dp[i][j - 1]));
                  	dp[i][j] = max(dp[i][j],dp[i-1][j - 1]);
                    num++;
                }
            }
        }
    }
    cout << dp[s][n - 1];
    return 0;
}

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