제출 #571865

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
571865		beaboss	Knapsack (NOI18_knapsack)	C++14	73 / 100	514 ms	262144 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;

int main() {
	int n, w;
	cin >> w >> n;

	vector<vector<int> > vals(n, vector<int>(3));
	for (int i = 0; i < n; i++) cin >> vals[i][0] >> vals[i][1] >> vals[i][2];

	vector<vector<int> > dp(n + 1, vector<int>(w + 1, 0));
	
	for (int item = 0; item < n; item ++) {
		for (int we = w; we >= 0; we--) {
			int current = we;
			int used = 0;
			
			while (current <= w && used <= vals[item][2]) {
				
				dp[item + 1][current] = max(dp[item][we] + used*vals[item][0],dp[item + 1][current]);
				current += vals[item][1];
				used++;
			}
		}
	}
	int ans = 0;
	for (auto val: dp[n]) ans = max(ans, val);
	cout << ans << endl;


}

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