Submission #1305179

#	Time	Username	Problem	Language	Result	Execution time	Memory
1305179		the_penitent_one	Knapsack (NOI18_knapsack)	C++20	37 / 100	2 ms	580 KiB

knapsack

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

int main(){
    int S, N;
    cin >> S >> N;

    vector<vector<int>> v(N, vector<int>(3));
    for(int i = 0; i < N; i++){
        cin >> v[i][0] >> v[i][1] >> v[i][2]; 
        // value, weight, count
    }

    vector<long long> dp(S + 1, 0);

    for(int i = 0; i < N; i++){
        int val = v[i][0];
        int wt  = v[i][1];
        int k   = v[i][2];

        // binary splitting
        for(int p = 1; k > 0; p <<= 1){
            int take = min(p, k);
            k -= take;

            int total_wt = take * wt;
            long long total_val = 1LL * take * val;

            for(int w = S; w >= total_wt; w--){
                dp[w] = max(dp[w], dp[w - total_wt] + total_val);
            }
        }
    }

    cout << dp[S] << "\n";
    return 0;
}

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