제출 #843283

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
843283		asdf334	Knapsack (NOI18_knapsack)	C++17	73 / 100	1056 ms	16568 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define sz(x) (int)x.size()
const int MAX = 1e5;
array<ll, 3> items[MAX]; // V, W, K
ll dp[2001][MAX]; // best V for each W using the first I types of items
int main() {
	ios_base::sync_with_stdio(false); cin.tie(nullptr);
	
	int S, N; cin >> S >> N;
	
	for (int i = 0; i < N; ++i) {
		cin >> items[i][0];
		cin >> items[i][1];
		cin >> items[i][2];
	}
	
	/*
	for (int i = 0; i < N; ++i) {
		cout << items[i][2] << " ";
	}
	*/
	
	for (int i = 0; i < N; ++i) {
		for (int pos = S; pos >= 0; --pos) {
			int increment_pos = pos; 
			int items_used = 0;
			ll add_weight = 0;
			
			while (increment_pos <= S && items_used <= items[i][2]) {
				dp[increment_pos][i + 1] = max(dp[increment_pos][i + 1], dp[pos][i] + add_weight);
				
				increment_pos += items[i][1];
				++items_used;
				add_weight += items[i][0];
			}
		}
	}
	
	ll ans = 0;
	for (int i = 0; i <= S; ++i) {
		ans = max(ans, dp[i][N]);
	}
	
	cout << ans << '\n';
}

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