제출 #487024

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
487024		sberens	Knapsack (NOI18_knapsack)	C++17	100 / 100	58 ms	3788 KiB

knapsack

#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <typename K> using hset = gp_hash_table<K, null_type>;
template <typename K, typename V> using hmap = gp_hash_table<K, V>;


using namespace std;

#define all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
#define smax(x, y) (x = max(x, y))
#define smin(x, y) (x = min(x, y))

using ll = long long;
using ld = long double;

template <typename T>
using vv = vector<vector<T>>;

using vi = vector<int>;
using ii = array<int, 2>;
using vii = vector<ii>;
using vvi = vv<int>;

using vll = vector<ll>;
using l2 = array<ll, 2>;
using vl2 = vector<l2>;
using vvll = vv<ll>;

template <typename T>
using minq = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using maxq = priority_queue<T>;

const ll M = 1000000007;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int s, n;
    cin >> s >> n;
    // weight -> sorted(val, amt)
    vv<ii> ws(s + 1);
    for (int i = 0; i < n; ++i) {
        int v, w, k;
        cin >> v >> w >> k;
        ws[w].pb({v, k});
    }
    for (auto & vec : ws) {
        sort(all(vec), greater<>());
    }
    vi dp(s + 1); // s, k
    for (int w = 1; w <= s; ++w) {
        if (ws[w].empty()) continue;
        auto ndp = dp;
        for (int ss = 0; ss <= s; ++ss) { // space left
            int tv = 0, tw = w;
            for (int i = 0; i < ws[w].size() && tw <= ss; ++i) {
                auto [v, k] = ws[w][i];
                for (int kk = 1; kk <= k && tw<= ss; ++kk) { // amount used
                    tv += v;
                    smax(ndp[ss], dp[ss - tw] + tv);
                    tw += w;
                }
            }

        }
        dp = ndp;
    }
    cout << *max_element(all(dp)) << '\n';

}

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

knapsack.cpp: In function 'int main()':
knapsack.cpp:61:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |             for (int i = 0; i < ws[w].size() && tw <= ss; ++i) {
      |                             ~~^~~~~~~~~~~~~~

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