제출 #1175426

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1175426		FZ_Laabidi	Knapsack (NOI18_knapsack)	C++20	0 / 100	1 ms	2112 KiB

knapsack

#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
    int s, n; cin >> s >> n;
    int sum =0;

    vector<int> v(n), w(n), k(n);
    for(int i=0; i<n; i++){
        cin >> v[i] >> w[i] >> k[i];
        k[i]= min(k[i], 2000LL);
        sum+=k[i]*w[i];
    }
    vector<int> weight, value;
    for(int i=0; i<n; i++){
        int opt = k[i];
        while(opt>0){
            int x = pow(2, (62 - __builtin_clz(opt)));
            opt-=x;
            value.push_back(x*v[i]);
            weight.push_back(x*w[i]);
        }
    }
    vector<int> knapsack(sum+1, 0);
    for(int i=0; i<value.size(); i++){
        for(int j =sum; j>=weight[i]; j--){
            knapsack[j]= max(knapsack[j], knapsack[j-weight[i]]+value[i]);
        }
    }
    cout << knapsack[s]<< endl;
}

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