Submission #601408

#	Time	Username	Problem	Language	Result	Execution time	Memory
601408		codergirl	Knapsack (NOI18_knapsack)	C++14	37 / 100	2 ms	340 KiB

knapsack

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

const int maxn=100005;
int c[maxn],value[maxn],num[maxn], dp[maxn];
int V;

void ZeroOnePack (int cost,int val){
    for(int i=V;i>=cost;i--) {
        dp[i]=max(dp[i],dp[i-cost] + val);
    }
    return ;
}

int main() {
    int n;
    cin>>V>>n; // knapsack size V, n kinds of items
    for(int i=1;i<=n;i++) {
        cin>>value[i]>>c[i]>>num[i]; // weight, value, quantity
    }
    for(int i=1;i<=n;i++) {
        int k=1;
        while(k<num[i]){
            ZeroOnePack(k * c[i], k * value[i]);
            num[i]-=k;
            k*=2;
        }
        ZeroOnePack(num[i]*c[i],num[i]*value[i]);
    }
    cout<<dp[V]<<'\n';
}

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