제출 #529324

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
529324		TruaShamu	Knapsack (NOI18_knapsack)	C++17	100 / 100	170 ms	125736 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair

int main() {
	int maxWeight, N;
	cin >> maxWeight >> N;
	vector<vector<pi>> items(maxWeight + 1, vector<pi>());

	for (int curW = 0; curW < N; curW++) {
		int V, W, K;
		cin >> V >> W >> K;
		items[W].pb({ V, K });
	}

	for (int curW = 0; curW <= maxWeight; curW++) {
		sort(all(items[curW]), greater<pi>());
	}

	int maxItems = 0;
	for (int curW = 1; curW <= maxWeight; curW++) {
		maxItems += maxWeight / curW;
	}

	vector<vi> dp(maxItems + 1, vi(maxWeight + 1, 0));
	int numItems = 1;
	for (int curW = 1; curW <= maxWeight; curW++) {
		if (items[curW].size() == 0) {
			continue;
		}
		int idx = 0;
		int copies = items[curW][0].second;

		for (int amt = 0; amt < maxWeight / curW; amt++) {
			for (int cur = 1; cur <= maxWeight; cur++) {
				dp[numItems][cur] = dp[numItems - 1][cur];
				if (cur - curW >= 0) {
					dp[numItems][cur] = max(dp[numItems][cur], dp[numItems - 1][cur - curW] + items[curW][idx].f);
				}
			}
			numItems++;
			copies--;
			if (copies == 0) {
				idx++;
				if (idx >= items[curW].size()) {
					break;
				}
				copies = items[curW][idx].s;
			}
		}
	}
	cout << dp[numItems - 1][maxWeight] << "\n";
}

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

knapsack.cpp: In function 'int main()':
knapsack.cpp:53:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |     if (idx >= items[curW].size()) {
      |         ~~~~^~~~~~~~~~~~~~~~~~~~~

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