Submission #757899

#	Time	Username	Problem	Language	Result	Execution time	Memory
757899		bzhu	Knapsack (NOI18_knapsack)	C++14	37 / 100	1080 ms	328 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;

int main() {
  cin.tie(0)->sync_with_stdio(0);
  long long s, n;
  cin >> s >> n;
  vector<long long> dp(s + 1);
  for (long long i=0; i<n; i++) {
    long long value, weight, quantity;
    cin >> value >> weight >> quantity;
    for (long long k=s; k>=weight; k--) {
      for (long long j=0; j<quantity; j++) {
        if (k >= (j + 1) * weight) {
          dp[k] = max(dp[k], dp[k - (j + 1) * weight] + (j + 1) * value);
        }
      }
    }
  }
  cout << dp[s] << endl;
  return 0;
}

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