제출 #1117946

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1117946		classic	Knapsack (NOI18_knapsack)	C++14	17 / 100	2 ms	592 KiB

knapsack

#include <bits/stdc++.h>

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	int limitWeight, numItem;
	std::cin >> limitWeight >> numItem;
	std::vector<std::pair<int, int>> items;
	for (int index = 0; index < numItem; index++) {
		int value, weight, amount;
		std::cin >> value >> weight >> amount;
		int power2 = 1;
		while (amount >= power2) {
			amount -= power2;
			items.emplace_back(weight * power2, value * power2);
			power2 *= 2;
		}
		if (amount > 0) {
			items.emplace_back(weight * power2, value * power2);
		}
	}
	std::vector<int> maxValue(limitWeight + 1);
	for (int index = 0; index < (int)items.size(); index++) {
		for (int weight = limitWeight; weight >= 0; weight--) {
			if (items[index].first <= weight) {
				maxValue[weight] = std::max(maxValue[weight], maxValue[weight - items[index].first] + items[index].second);
			}
		}
	}
	std::cout << maxValue[limitWeight];
	return 0;
}

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