제출 #1033471

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1033471		cryptobunny	Knapsack (NOI18_knapsack)	C++17	100 / 100	105 ms	3924 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;

int main() {
    int s, n;
    cin >> s >> n;
    vector<int> dp(s + 1, INT_MIN);
    map<int, vector<pair<int, int>>> items;
    for (int i = 0; i < n; i++) {
        int v, w, k;
        cin >> v >> w >> k;
        items[w].push_back({v, k});
    }
    int ans = 0;
    dp[0] = 0;
    for (auto &[w, a] : items) {
        sort(a.begin(), a.end());
        reverse(a.begin(), a.end());
        for (int c = s; c >= 0; c--) {
            int i = 0, tot = 0, used = 0, gained = 0;
            while ((tot + 1) * w <= c && i < a.size()) {
                tot++;
                gained += a[i].first;
                if (dp[c - w * tot] != INT_MIN) {
                    dp[c] = max(dp[c], dp[c - w * tot] + gained);
                    ans = max(ans, dp[c]);
                }
                used++;
                if (used == a[i].second) {
                    i++;
                    used = 0;
                }
            }
        }
    }
    cout << ans << endl;
}

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

knapsack.cpp: In function 'int main()':
knapsack.cpp:21: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]
   21 |             while ((tot + 1) * w <= c && i < a.size()) {
      |                                          ~~^~~~~~~~~~

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