제출 #562986

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
562986		acatmeowmeow	Knapsack (NOI18_knapsack)	C++11	100 / 100	70 ms	5096 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;

#define int long long 

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, W;
	cin >> W >> n;
	vector<tuple<int, int, int>> arr(n + 5);
	for (int i = 1; i <= n; i++) {
		int v, w, k;
		cin >> v >> w >> k;
		k = min(k, W/w);
		arr[i] = {v, w, k};
	}
	sort(arr.begin() + 1, arr.begin() + n + 1, greater<tuple<int, int, int>>());
	vector<pair<int, int>> item;
	vector<int> cnt(W + 5);
	for (int i = 1; i <= n; i++) {
		int v = get<0>(arr[i]), w = get<1>(arr[i]), k = get<2>(arr[i]), lim = min(k, W/w - cnt[w]);
		for(int j = 1; j <= lim; j++) item.push_back({v, w}), cnt[w]++; 
	}
	vector<int> dp(W + 5);
	for (int i = 0; i < (int)item.size(); i++) {
		vector<int> dq(dp);
		int v = item[i].first, w = item[i].second;
		for (int j = w; j <= W; j++) dq[j] = max(dq[j], dp[j - w] + v); 
		swap(dp, dq);
	}
	cout << dp[W] << '\n';
	return 0;
}

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