제출 #1295527

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1295527		michaeltaranik	Knapsack (NOI18_knapsack)	C++17	73 / 100	1097 ms	584 KiB

knapsack

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

void solve() {
    int s, n;
    cin >> s >> n;
    vector<int> dp(s + 1, 0);

    for (int i = 0; i < n; ++i) {
        int v, w, q;
        cin >> v >> w >> q;
        
        // Binary optimization with early break
        if (w == 0) {
            // Free items - take all
            for (int j = s; j >= 0; --j) {
                dp[j] += v * q;
            }
            continue;
        }
        
        int max_use = min(q, s / w); // Don't process more than we can possibly use
        for (int k = 1; max_use > 0; k <<= 1) {
            int take = min(k, max_use);
            int chunkV = take * v;
            int chunkW = take * w;

            for (int j = s; j >= chunkW; --j) {
                if (dp[j - chunkW] + chunkV > dp[j]) {
                    dp[j] = dp[j - chunkW] + chunkV;
                }
            }
            
            max_use -= take;
        }
    }

    cout << dp[s] << endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
}

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