제출 #918314

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
918314		kotnid	Knapsack (NOI18_knapsack)	C++14	73 / 100	1069 ms	1440 KiB

knapsack

/* 

knapsack with multiple amount 

-> express as 2^0, 2^1,.... 

*/

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

typedef long long ll;

int main(){
    ll s, n;
    cin >> s >> n;

    ll dp[s+1];
    memset(dp,0,sizeof dp);

    for(int i=0; i<n; i++){
        ll v, w, k;
        cin >> v >> w >> k;

        ll c = 1; 
        while(c <= k){
            ll v2 = v*c, w2 = w*c;
            for(int j=s; j>=w2; j--)dp[j] = max(dp[j], dp[j-w2]+v2);
            k -= c;
            c *= 2;
        }

        if(k != 0){
            ll v2 = v*k, w2 = w*k;
            for(int j=s; j>=w2; j--)dp[j] = max(dp[j], dp[j-w2]+v2);
        }
    }

    cout << dp[s];
}

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