Submission #850185

#	Time	Username	Problem	Language	Result	Execution time	Memory
850185		alexz1205	Knapsack (NOI18_knapsack)	C++14	73 / 100	1046 ms	1368 KiB

knapsack

#include <iostream>
using namespace std;

const int S = 2000, N = 1e5;

int arr[S+1];

int main() {
	int s, n;
	cin >> s >> n;
	for (int x = 0; x < n; x ++){
		int v, w, k;
		cin >> v >> w >> k;
		k = min(k, s/w);
		for (int x = 0; x < k; x ++){
			for (int i = s-w; i >= 0; i --){
				arr[i+w] = max(arr[i+w], arr[i]+v);
			}
			for (int i = 1; i <= s; i ++){
				arr[i] = max(arr[i], arr[i-1]);
			}
		}
	}
	cout << arr[s] << endl;
	return 0;
}

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