Submission #750349

#	Time	Username	Problem	Language	Result	Execution time	Memory
750349		nguyennehehe	Knapsack (NOI18_knapsack)	C++14	37 / 100	1 ms	468 KiB

knapsack

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

signed main() {
  cin.tie(nullptr)->sync_with_stdio(false);

  int s, n; cin >> s >> n;
  vector<pair<int, int>> a;
  for (int i = 1; i <= n; ++i) {
    int v, w, k; cin >> v >> w >> k;

    int pw = 1;
    while (pw <= k) {
      k -= pw;
      a.emplace_back(w * pw, v * pw);
      pw <<= 1;
    }
    if (k > 0) a.emplace_back(w * k, v * k);
  }

  vector<long long> dp(s + 1);
  for (pair<int, int> p: a) {
    for (int w = s; w >= p.first; --w) {
      dp[w] = max(dp[w], dp[w - p.first] + p.second);
    }
  }

  cout << *max_element(dp.begin(), dp.end());
}

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