Submission #967774

#	Time	Username	Problem	Language	Result	Execution time	Memory
967774		stdfloat	Knapsack (NOI18_knapsack)	C++17	100 / 100	48 ms	1884 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<vector<pair<int, int>>> u(S + 1);
	while (n--) {
		int v, w, k;
		cin >> v >> w >> k;
 
		u[w].push_back({v, k});
	}
	
	vector<int> V, W;
	for (int i = 1; i <= S; i++) {
		sort(u[i].rbegin(), u[i].rend());
 
		int s = S / i;
		for (auto [v, k] : u[i]) {
			int mn = min(s, k);
 
			while (mn--) {
				V.push_back(v);
				W.push_back(i);
			}
 
			s -= min(s, k);
		}
	}
 
 
	vector<ll> 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: 12 / 12
• Subtask 2: 17 / 17
• Subtask 3: 20 / 20
• Subtask 4: 24 / 24
• Subtask 5: 27 / 27