Submission #1092106

#	Time	Username	Problem	Language	Result	Execution time	Memory
1092106		vjudge1	Knapsack (NOI18_knapsack)	C++17	100 / 100	38 ms	5212 KiB

knapsack

#include <bits/stdc++.h>

#define int long long
#define pb push_back

using namespace std;

const int maxn = 1e5 + 10, maxs = 2e3 + 10;

int s, n, dp[maxs];
vector <pair <int, int>> item[maxn];

int32_t main (){
	ios_base::sync_with_stdio(0);
	cin >> s >> n;
	for (int v, w, k, i = 0; i < n; i++)
		cin >> v >> w >> k,
		item[w].pb({v, k});
	for (int i = 1; i <= s; i++){
		sort(item[i].begin(), item[i].end(), greater<pair <int, int>>());
		int w = 0;
		for (auto [v, k] : item[i]){
			while (w + i <= s && k){
				k--;
				w += i;
				for (int j = s; j >= i; j--)
					dp[j] = max(dp[j], dp[j - i] + v);
			}
			if (w + i > s) break;
		}
	}
	cout << dp[s];
}

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