Submission #1251014

#	Time	Username	Problem	Language	Result	Execution time	Memory
1251014		LaMatematica14	Knapsack (NOI18_knapsack)	C++20	37 / 100	1 ms	328 KiB

knapsack

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

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    int N, S; cin >> S >> N;

    vector<long long> vfw(S+1, 0), aus(S+1);
    
    auto upd = [&](int v, int w) {
        for (int i = S; i >= 0; i--) {
            aus[i] = vfw[i];
            if (i >= w) aus[i] = max(vfw[i], vfw[i-w]+v);
        }
    };
    
    for (int i = 0; i < N; i++) {
        long long V, W, K; cin >> V >> W >> K;
        for (long long k = 1; k <= K; k<<=1) {
            upd(V*k, W*k);
            K-=k;
            vfw = aus;
        }
        if (K > 0) upd(V*K, W*K);
        vfw = aus;
    }
    long long best = 0;
    for (long long i : vfw) best = max(best, i);
    cout << best << "\n";
}

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