Submission #1192840

#	Time	Username	Problem	Language	Result	Execution time	Memory
1192840		dprto	Knapsack (NOI18_knapsack)	C++20	17 / 100	2 ms	328 KiB

knapsack

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAXN = 1e5 + 5;


int s, n, v[MAXN], w[MAXN], k[MAXN], dp[MAXN];

void sub1(){
    for(int i = 1; i <= n; ++i){
        for(int j = s; j >= w[i]; --j){
            dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
        }
    }
    cout << dp[s];
}

void sub2(){
    for(int i = 1; i <= n; ++i){
        for(int j = s; j >= w[i]; --j){
            for(int q = 1; q <= k[i] and q * w[i] <= j; ++q){
                dp[j] = max(dp[j], dp[j - q * w[i]] + q * v[i]);
            }
        }
    }
}

signed main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> s >> n; int maxk = 0;
    for(int i = 1; i <= n; ++i){
        cin >> v[i] >> w[i] >> k[i];
        maxk = max(maxk, k[i]);
    }

    if(maxk == 1) sub1();
    else sub2();
    


    return 0;
}

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