제출 #679398

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
679398		nicolexxuu	Knapsack (NOI18_knapsack)	C++14	29 / 100	2 ms	212 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;
long long S, N;
long long dp[2001];

int main() {
	cin >> S >> N;
	
	for(int i = 0; i < N; i++) {
//		cin >> items[i][0] >> items[i][1] >> items[i][2];
		long long V, W, K;
		cin >> V >> W >> K;
		
		for(int i = 1; i <= min(S, K) && i*W <= S; i++) dp[S] = max(dp[S], dp[S-W*i] + V*i);
		
//		cout << "starting end val: " << dp[S] << endl;
		for(int s = S-1; s >= 1; s--) {
//			cout << "s: " << s << "W:" << W << " K: " << K << endl;
//			cout << "W*K: " << W*K << endl;
			int cnt = min(K, s / W);
//				cout << "why: " << dp[s-W*K] << endl;
				dp[s] = max(dp[s], dp[s-W*cnt] + V*cnt);
//			cout << "got here" << endl;
		}
//		cout << "hi2" << endl;
	}
	
	cout << dp[S] << endl;
}
/*
2000 1
5 5 1
9
*/

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