제출 #1262658

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1262658		sohamsen15	Knapsack (NOI18_knapsack)	C++20	73 / 100	1094 ms	18548 KiB

knapsack

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll c, n; 
    cin >> c >> n;
    vector<ll> v(n), w(n), k(n);
    for (int i = 0; i < n; i++) cin >> v[i] >> w[i] >> k[i];

    // cap multiplicities at 2000 (as in your code)
    for (int i = 0; i < n; i++) k[i] = min(k[i], 2000ll);

    vector<ll> vt, wt;
    for (int i = 0; i < n; i++) {
        ll copy = k[i], currpow = 1;
        while (copy > 0) {
            ll take = min(currpow, copy);
            vt.push_back(v[i] * take);
            wt.push_back(w[i] * take);
            copy -= take;
            currpow <<= 1;
        }
    }

    vector<ll> dp(c + 1, 0);
    for (size_t i = 0; i < vt.size(); i++) {
        for (ll cap = c; cap >= wt[i]; cap--) {
            dp[cap] = max(dp[cap], dp[cap - wt[i]] + vt[i]);
        }
    }

    cout << dp[c] << "\n";
}

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