제출 #1218179

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1218179		shuvo_06	Knapsack (NOI18_knapsack)	C++20	73 / 100	170 ms	327680 KiB

knapsack

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

#define inf 1e15

int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    #ifdef SUBLIME
        freopen("inputf.in", "r", stdin);
        freopen("outputf.out", "w", stdout);
        freopen("error.txt", "w", stderr);
    #endif

    int n, w;
    cin >> w >> n;

    vector<pair<long long, long long>> obj;
    for (int i = 0; i < n; i++) {
        long long wt, val, copy;
        cin >> val >> wt >> copy;
        for (long long p = 1; copy; p <<= 1) {
            long long take = min(p, copy);
            obj.push_back({take * wt, take * val}); 
            copy -= take;
        }
    }

    n = obj.size();
    vector<vector<long long>> dp(n + 1, vector<long long>(w + 1, 0));

    for (int no = 1; no <= n; no++) {
        auto [wt, val] = obj[no - 1]; 
        for (int rw = 0; rw <= w; rw++) {
            dp[no][rw] = dp[no - 1][rw];
            if (rw >= wt)
                dp[no][rw] = max(dp[no][rw], dp[no - 1][rw - wt] + val);
        }
    }

    cout << *max_element(dp[n].begin(), dp[n].end()) << "\n";

    return 0;
}

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