Submission #1124789

#	Time	Username	Problem	Language	Result	Execution time	Memory
1124789		dwuy	Knapsack (NOI18_knapsack)	C++17	73 / 100	1095 ms	2628 KiB

knapsack

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

const int MX = 100005;
int S, n;
int v[MX], w[MX], k[MX];
int f[2005];

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> S >> n;
    for(int i=1; i<=n; i++) cin >>  v[i] >> w[i] >> k[i];

    for(int i=1; i<=n; i++){
        k[i] = min(k[i], S/w[i]);
        for(int t=1; k[i]>0; t=min(k[i], t<<1)){
            int val = v[i]*t;
            int wei = w[i]*t;
            for(int j=S; j>=wei; j--){
                f[j] = max(f[j], f[j-wei] + val);
            }
            k[i] -= t;
        }   
    }

    cout << *max_element(f + 0, f + S + 1);

    return 0;
}

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