Submission #679388

#	Time	Username	Problem	Language	Result	Execution time	Memory
679388		nicolexxuu	Knapsack (NOI18_knapsack)	C++14	17 / 100	1 ms	340 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;
int S, N, items[100000][3];
int dp[2001];

int main() {
	cin >> S >> N;
	
	for(int i = 0; i < N; i++) {
//		cin >> items[i][0] >> items[i][1] >> items[i][2];
		int V, W, K;
		cin >> V >> W >> K;
		for(int i = 1; i <= K && i*W <= S; i++) dp[S] = max(dp[S], dp[S-W*i] + V*i);
		
		for(int s = S-1; s >= 1; s--) {
			if(W * K <= s) dp[s] = max(dp[s], dp[s-W*K] + V*K);
		}
	}
	
	cout << dp[S] << endl;
}

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