Submission #1049789

#	Time	Username	Problem	Language	Result	Execution time	Memory
1049789		MarkTYZhang	Knapsack (NOI18_knapsack)	C++17	37 / 100	3 ms	8796 KiB

knapsack

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


ll V[3000005],W[3000005];
ll dp[100001];

int zero_one_knapsack(){
    int s,n;
    cin >> s >> n;

    int index = 0;
    for (int i=1;i<=n;i++){
        int v,w,k;
        cin >> v >> w >> k;
        int j = 1;
        while (k>=j){ 
            V[++index] = v * j;
            W[index] = w * j;
            k -= j;
            j *= 2;
        }
        if (k>0){
            V[++index] = v * k;
            W[index] = w * k;
            
        }
    }

    for (int i=1;i<=index;i++){
        for (int j=s;j>=W[i];j--){
                if (j-W[i]<0) break;
                dp[j] = max(dp[j], dp[j-W[i]] + V[i]);
            
        }
    }

    return dp[s];
}


int main(){
	ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cout << zero_one_knapsack();



    return 0;   
}

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