제출 #1020969

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1020969		urejgi	Knapsack (NOI18_knapsack)	C++17	73 / 100	1058 ms	16300 KiB

knapsack

#include <iostream>
#include <vector>
#define int long long
using namespace std;

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int s, n;
    cin >> s >> n;
    vector<int> value, weight;
    int v, w, k;
    for (int i = 0; i < n; ++i) {
        cin >> v >> w >> k;
        int count = 1;
        while (k > 0) {
            int currentCount = min(count, k);
            value.push_back(currentCount * v);
            weight.push_back(currentCount * w);
            k -= currentCount;
            count <<= 1;
        }
    }
    int totalItems = value.size();
    vector<int> dp(s + 1, 0);
    dp.reserve(s + 1); // preallocate memory
    for (int i = 0; i < totalItems; ++i) {
        for (int j = s; j >= weight[i]; --j) {
            if (j - weight[i] < 0) break; // avoid unnecessary computations
            dp[j] = max(dp[j], dp[j - weight[i]] + value[i]);
        }
    }
    cout << dp[s] << endl;
    return 0;
}

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