Submission #976109

#	Time	Username	Problem	Language	Result	Execution time	Memory
976109		vjudge1	Knapsack (NOI18_knapsack)	C++17	0 / 100	2 ms	348 KiB

knapsack

#include <bits/stdc++.h>
#define int long long
#define f first
#define s second
#define pb push_back
#define endl '\n'
using namespace std;

int S,N,V,W,K,dp[2002];

void solve() {
	cin >> S >> N;
	dp[0] = 0;
	for (int i = 1; i <= S; i++) dp[i] = -1e9;
	for (int i = 1; i <= N; i++) {
		cin >> V >> W >> K;
		K = min(K, 2000 * 1ll);
		while (K--) {
			for (int j = S; j >= W; j--) {
				dp[j] = max(dp[j], dp[j - W] + V); 
			}
		}
	} cout << dp[S] << endl;
}

int32_t main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int tttt = 1;
	//cin >> tttt;
	while (tttt--) solve();
}

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