Submission #1295571

#	Time	Username	Problem	Language	Result	Execution time	Memory
1295571		michaeltaranik	Knapsack (NOI18_knapsack)	C++17	73 / 100	1095 ms	580 KiB

knapsack

#include <iostream>
#include <limits.h>
#include <vector>
#include <array>

using namespace std;
typedef long long ll;

void solve() {
    int s, n;
    cin >> s >> n;
    vector<ll> dp(s+1);

    for (int i = 0; i < n; ++i) {
        int w;
        ll v, q;
        cin >> v >> w >> q;
        
        // fucking binary optimization
        for (ll k = 1; q > 0; k <<= 1) {
            ll take = min(k, q);
            ll chunkV = take * v;
            ll chunkW = take * w;

            if (chunkW <= s) {
              for (int j = s; j >= chunkW; --j) {
                dp[j] = max(dp[j], dp[j - chunkW] + chunkV);
              }
            }
            q -= take;
        }
    }

    cout << dp[s] << endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
}

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