Submission #964137

#	Time	Username	Problem	Language	Result	Execution time	Memory
964137		stdfloat	Knapsack (NOI18_knapsack)	C++17	37 / 100	1034 ms	27316 KiB

knapsack

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

using ll = long long;

int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);

	int S, n;
	cin >> S >> n;

	vector<int> V, W;
	for (int i = 0; i < n; i++) {
		int v, w, k;
		cin >> v >> w >> k;

		while (k--) {
			V.push_back(v);
			W.push_back(w);
		}
	}

	vector<int> dp(S + 1, -1);
	dp[0] = 0;
	for (int i = 0; i < (int)V.size(); i++) {
		for (int j = S; j >= W[i]; j--)
			if (dp[j - W[i]] != -1) dp[j] = max(dp[j], dp[j - W[i]] + V[i]);
	}

	cout << *max_element(dp.begin(), dp.end());
}

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