제출 #1109349

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1109349		greenbinjack	Knapsack (NOI18_knapsack)	C++17	100 / 100	270 ms	3752 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 < vector < pair <int, int> > > weight (s + 1);
  for (int i = 0; i < n; i++) {
    int v, w, k;
    cin >> v >> w >> k;
    weight[w].push_back ({v, k});
  }

  for (int i = 1; i <= s; i++) sort (weight[i].rbegin (), weight[i].rend ());

  vector <LL> dp (s + 1), ndp (s + 1);
  for (LL i = 1; i <= s; i++) {
    for (LL j = s; j >= 0; j--) {
      ndp[j] = dp[j];
      LL k = 1, profit = 0;
      for (auto [v, copy] : weight[i]) {
        for (LL p = 0; p < copy and k * i <= s and k * i <= j; k++, p++) {
          profit += v;
          ndp[j] = max (ndp[j], dp[j - k * i] + profit);
        }
      }
    }
    swap (dp, ndp);
  }

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

  return 0;
}

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