제출 #798857

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
798857		hoangreal	Knapsack (NOI18_knapsack)	C++17	0 / 100	4 ms	6356 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
 
#define D(x) cerr << #x << " = " << x << ", "
 
using vi = vector<int>;
using vvi = vector<vi>;
 
struct Elem {
	int v, w, k;
 
	int order() const {
		return -v;
	}
};
 
bool operator<(const Elem& lhs, const Elem& rhs) {
	return lhs.order() < rhs.order();
}
 
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
 
	int s, n;
	cin >> s >> n;
	vector<vector<Elem>> elems(s+1);
	for (int i = 0; i < n; ++i) {
		Elem e;
		cin >> e.v >> e.w >> e.k;
		elems[e.w].push_back(e);
	}
 
	for (int w = 1; w <= s; ++w) {
		sort(elems[w].begin(), elems[w].end());
	}
 
	vvi dp(s+1, vi(s+1));
	int ans = 0;
 
	for (int w = 1; w <= s; ++w) {
		for (int j = 0; j <= s; ++j) {
			dp[w][j] = dp[w-1][j]; // “I am not interested in this item,” 

			// “I’d like at least one of these.”
			int acum = 0;
			int space = 0;
			for (Elem e : elems[w]) {
				for (int it = 0; it < e.k; ++it) {
					acum += e.v;
					space += w;
					if (space > j) break;
					dp[w][j] = max(dp[w][j], dp[w-1][j-space] + acum);
				}
				if (space > j) break; // Too much of the same weight
			}
		}
		// ans = max(ans, dp[w][s]);
	}
 
	cout << dp[n][s] << endl;
}

컴파일 시 표준 에러 (stderr) 메시지

knapsack.cpp: In function 'int main()':
knapsack.cpp:39:6: warning: unused variable 'ans' [-Wunused-variable]
   39 |  int ans = 0;
      |      ^~~

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