제출 #679654

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
679654		nicolexxuu	Knapsack (NOI18_knapsack)	C++17	12 / 100	1 ms	212 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;

int main() {
	int S, N;
	cin >> S >> N;
	
	map<int, vector<pair<int, int>>> by_weight;
	for(int t = 0; t < N; t++) {
		int V, W, K;
		cin >> V >> W >> K;
		by_weight[W].push_back({V, K});
	}
	
	vector<vector<int>> dp(by_weight.size()+1, vector<int>(S+1));
	
	int res = 0;
	int i = 1;
	for(auto& hi : by_weight) {
		auto w = hi.first;
		auto items = hi.second;
		for(int s = 1; s <= S; s++) {
			dp[i][s] = dp[i-1][s];
			
			int curr_i = 0, curr_cnt = 0, val = 0;
			for(int cnt = 1; cnt * w <= s && curr_i < items.size(); cnt++) {
				val += items[curr_i].first;
				if(++curr_cnt == items[curr_i].second) {
					curr_cnt = 0;
					curr_i++;
				}
				dp[i][s] = max(dp[i][s], dp[i-1][s-cnt*w] + val);
			}
		}
		
		res = max(dp[i][S], res);
		i++;
	}
	
	cout << res << endl;
}

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

knapsack.cpp: In function 'int main()':
knapsack.cpp:27:44: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |    for(int cnt = 1; cnt * w <= s && curr_i < items.size(); cnt++) {
      |                                     ~~~~~~~^~~~~~~~~~~~~~

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