제출 #967530

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
967530		stdfloat	Knapsack (NOI18_knapsack)	C++17	73 / 100	231 ms	262144 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;

	map<int, vector<pair<int, int>>> m;
	for (int i = 0; i < n; i++) {
		int v, w, k;
		cin >> v >> w >> k;

		m[w].push_back({-v, k});
	}
	
	vector<ll> V, W;
	for (auto w : m) {
		int s = S / w.first;
		for (auto [v, k] : w.second) {
			int mn = min(s, k);

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

			s -= mn;
		}
	}


	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: 0 / 27