제출 #482930

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
482930		Olympia	Knapsack (NOI18_knapsack)	C++17	100 / 100	144 ms	5048 KiB

knapsack

#include <cmath>
#include <iostream>
#include <set>
#include <climits>
#include <algorithm>
#include <cassert>
#include <vector>
#include <iomanip>
#include <type_traits>
#include <string>
#include <queue>
#include <map>
using namespace std;
#define ll long long
struct item {
    long long weight;
    long long worth;
    long long cnt;
};
bool comp (item i1, item i2) {
    if (i1.weight == i2.weight) {
        return (i1.worth > i2.worth);
    }
    return (i1.weight < i2.weight);
}
int main() {
    //freopen("hamming.in", "r", stdin);
    long long S, N;
    cin >> S >> N;
    vector<item> items;
    for (int i = 0; i < N; i++) {
        long long wei, wor;
        cin >> wor >> wei;
        long long cnt;
        cin >> cnt;
        items.push_back({wei, wor, cnt});
    }
    sort(items.begin(), items.end(), comp);
    vector<item> new_item;
    map<int,int> myMap;
    for (item item: items) {
        if (myMap[item.weight] * item.weight > S) {
            continue;
        }
        myMap[item.weight] += item.cnt;
        new_item.push_back(item);
    }
    swap(new_item, items);
    long long dp[S + 1];
    for (int j = 0; j <= S; j++) {
        dp[j] = 0;
    }
    long long myMax = 0;
    for (int i = 1; i <= items.size(); i++) {
        for (int j = S; j >= 0; j--) {
            int cntr = 0;
            while (cntr * items[i - 1].weight <= j && cntr <= items[i - 1].cnt) {
                dp[j] = max(dp[j], dp[j - cntr * items[i - 1].weight] + cntr * items[i - 1].worth);
                cntr++;
            }
            myMax = max(myMax, dp[j]);
        }
    }
    cout << myMax << endl;
}

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

knapsack.cpp: In function 'int main()':
knapsack.cpp:54:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<item>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     for (int i = 1; i <= items.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~

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