Submission #847732

#	Time	Username	Problem	Language	Result	Execution time	Memory
847732		dubabuba	Knapsack (NOI18_knapsack)	C++14	0 / 100	3 ms	7156 KiB

knapsack

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

const int mxn = 1e5 + 10;
const int mxs = 2000 + 9;
int dp[mxn][mxs], n, s, ans;
int pr[mxn], we[mxn], am[mxn];

int main() {
	cin >> n;
	for(int i = 0; i < n; i++)
		cin >> pr[i] >> we[i] >> am[i];

	for(int i = 0; i < n; i++)
	for(int j = 0; j <= s; j++)
	for(int k = 0; k <= am[i] && k * we[i] <= s; k++) {
		dp[i][j] = max(dp[i][j], dp[i - 1][j - k * we[i]] + k * pr[i]);
		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