Submission #1170291

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

knapsack

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 5;
long long dp[MAXN];
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int s, n;
    cin >> s >> n;
    for (int i = 0; i < n; i++) {
        int v, w, k;
        cin >> v >> w >> k;
        vector<int> item;
        for (int j = 1; k > 0; j *= 2) {
            int take = min(j, k);
            item.push_back(take);
            k -= take;
        }
        for (int take : item) {
            for (int j = s; j >= take * w; j--) {
                dp[j] = max(dp[j], dp[j - take * w] + take * v);
            }
        }
    }
    
    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