제출 #1286275

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1286275		Soju	Knapsack (NOI18_knapsack)	C++20	100 / 100	768 ms	68428 KiB

knapsack

#pragma GCC optimize("O3,inline,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define all(v) (v).begin(), (v).end()
#define rall(v) (v).begin(), (v).end()
#define debug cerr << "[DEBUG] "

const char wp = ' ';
const char nl = '\n';

void kebin() {
    ll s, n;
    cin >> s >> n;

    vector<tuple<ll, ll, ll>> arr(n);
    for (auto &[a, b, c] : arr) {
        cin >> a >> b >> c;
        // {value, weight, number (or copies)}
    }

    vector<pair<ll, ll>> items;
    vector<ll> dp(s+1);

    for (auto [val, w, cnt] : arr) {
        ll k = 1;
        while (cnt > 0) {
            ll take = min(k, cnt);
            items.push_back({val * take, w * take});
            cnt -= take;
            k <<= 1;
        }
    }

    for (auto [val, weight] : items) {
        for (int w = s; w >= weight; w--) {
            dp[w] = max(dp[w], dp[w - weight] + val);
        }
    }

    cout << *max_element(all(dp)) << nl;
}

signed main() {
    cin.tie(0)->sync_with_stdio(false);

    int t = 1;
    // cin >> t;
    while (t--) kebin();
}

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