제출 #1302640

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1302640		ramzialoulou	Knapsack (NOI18_knapsack)	C++20	100 / 100	65 ms	33236 KiB

knapsack

#include <bits/stdc++.h> 

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int s, n;
  cin >> s >> n;
  map<int, vector<pair<int, int>>> mp;
  for (int i = 0; i < n; i++) {
    int v, w, k;
    cin >> v >> w >> k;
    mp[w].emplace_back(v, k);
  }
  int m = int(mp.size());
  vector<vector<int64_t>> best(m + 1, vector<int64_t>(s + 1));
  int p = 0;
  for (auto [w, a] : mp) {
    sort(a.rbegin(), a.rend());
    for (int W = 0; W <= s; W++) {
      best[p + 1][W] = max(best[p + 1][W], best[p][W]);
      int k = 1, i = 0;
      int used = 0;
      int64_t cost = 0;
      while (k * w <= W && i < int(a.size())) {
        cost += a[i].first;
        used++;
        best[p + 1][W] = max(best[p + 1][W], best[p][W - k * w] + cost);
        if (used == a[i].second) {
          used = 0;
          i++;
        }
        k++;
      }
    }
    p++;
  }
  cout << *max_element(best[m].begin(), best[m].end()) << '\n';
  return 0;
}

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