제출 #1109333

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1109333		greenbinjack	Knapsack (NOI18_knapsack)	C++14	73 / 100	199 ms	262144 KiB

knapsack

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

#define all(v) v.begin(), v.end()

using LL = long long;

int main() {
  cin.tie(nullptr)->ios_base::sync_with_stdio(false); 

  LL s, n;
  cin >> s >> n;
  vector <LL> weight (n), val (n), copy (n);
  for (int i = 0; i < n; i++) cin >> val[i] >> weight[i] >> copy[i];

  vector < vector <LL> > dp (n + 1, vector <LL> (s + 1));
  for (LL i = 1; i <= n; i++) {
    for (LL j = s; j >= 0; j--) {
      for (LL k = 0; k <= copy[i - 1] and k * weight[i - 1] <= s and k * weight[i - 1] <= j; k++) {  
        dp[i][j] = max (dp[i][j], dp[i - 1][j - k * weight[i - 1]] + k * val[i - 1]);
      }
    }
  }

  cout << *max_element (all (dp[n])) << '\n';

  return 0;
}

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