Submission #1220069

#	Time	Username	Problem	Language	Result	Execution time	Memory
1220069		pauloaph	Knapsack (NOI18_knapsack)	C++20	73 / 100	1093 ms	328 KiB

knapsack

#include<iostream>
#include<algorithm>
#include <cmath>
using namespace std;

int main(){

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int C;
    int n;

    cin >> C >> n;

    long long v, w, b;
    vector<long long> dp(C + 1, 0);
    
    for(int i = 0; i < n; i++){
        int x = 1;
        cin >> v >> w >> b;

        if(b > C*w) b = C/w;

        //Decomposição Binaria
        while(b > x){
            long long total_w = x * w;
            long long total_v = x * v;


            //Processa dp conforme insere os items
            for (int c = C; c >= total_w; c--) {
                dp[c] = max(dp[c], dp[c - total_w] + total_v);
            }

            b -= x;
            x = x << 1;
        }

        //Resto da decomposição
        long long total_w = b * w;
        long long total_v = b * v;

        for (int c = C; c >= total_w; c--) {
            dp[c] = max(dp[c], dp[c - total_w] + total_v);
        }
    }


   cout << dp[C] << endl;
   return 0;
}

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