제출 #918871

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
918871		absolutePi	Knapsack (NOI18_knapsack)	C++17	100 / 100	121 ms	33260 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;

#define ll long long

int main(){
    //ios::sync_with_stdio(false);
    //cin.tie(0);
    int limit,goods_num;
    cin >> limit >> goods_num;
    map<int,vector<pair<int,int>>> by_weight;
    for(int i=0;i<goods_num;i++){
        int value,weight,num;
        cin >> value >> weight >> num;
        if(weight<=limit && num>0){
            by_weight[weight].push_back({value,num});
        }
    }
    vector<vector<ll>> dp(by_weight.size()+1,vector<ll>(limit+1,INT32_MIN));
    dp[0][0]=0;
    //dp[fitst i weight][j capacity]
    int at=1;
    for(auto &[w,items] : by_weight){
        sort(items.begin(),items.end(),greater<pair<int,int>>());
        for(int cap=0;cap<=limit;cap++){
            dp[at][cap]=dp[at-1][cap];
            int copies=0;
            int type_at=0;
            int curr_used=0;
            ll profit=0;
            while((copies+1)*w<=cap && type_at<items.size()){
                copies++;
                profit+=items[type_at].first;
                if(dp[at-1][cap-copies*w]!=INT32_MIN){
                    dp[at][cap]=max(dp[at][cap],dp[at-1][cap-copies*w]+profit);
                }
                curr_used++;
                if(curr_used==items[type_at].second){
                    type_at++;
                    curr_used=0;
                }
            }
        }
        at++;
    }
    cout << *max_element(dp.back().begin(),dp.back().end()) << '\n';
}   

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

knapsack.cpp: In function 'int main()':
knapsack.cpp:32:47: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |             while((copies+1)*w<=cap && type_at<items.size()){
      |                                        ~~~~~~~^~~~~~~~~~~~~

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