Submission #650285

#	Time	Username	Problem	Language	Result	Execution time	Memory
650285		dubabuba	Knapsack (NOI18_knapsack)	C++14	0 / 100	2 ms	980 KiB

knapsack

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

#define int long long
int dp[200000][1005];

signed main() {
    int s, n;
    cin >> s >> n;

    int pr[n+1], we[n+1], am[n+1];
    for(int i = 1; i <= n; i++)
    cin >> pr[i] >> we[i] >> am[i];

    int ans = 0;
    for(int i = 1; i <= n; i++) {
        for(int j = 0; j <= s; j++) {
            for(int k = 0; k <= am[i] && k * we[i] <= j; k++)
            dp[i][j] = max(dp[i][j], dp[i-1][j - we[i] * k] + pr[i] * k);
            ans = max(ans, dp[i][j]);
        }
    }

    cout << ans << '\n';
	return 0;
}

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