제출 #1129222

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1129222		jackofall718	Knapsack (NOI18_knapsack)	C++20	73 / 100	479 ms	327680 KiB

knapsack

#include <bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define vn vector <ll>
using namespace std;
const int MAX_N = 1e9 + 7;
#define pii pair <ll,ll>
const ll INF = 0x3f3f3f3f3f3f3f3f;

#define pb push_back
#define srt(vp) sort(vp.begin(), vp.end())

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll s, n;
  cin >> s >> n;
  map<ll, vn> items;
  for (int i = 0; i < n; i++) {
    ll v, w, k;
    cin >> v >> w >> k;
    ll limit = min(k, s / w);
    for (int j = 0; j < limit; j++) {
      items[w].pb(v);
    }
  }

  vn weights, prices;
  for (auto& item : items) {
    ll weight = item.first;
    auto& vals = item.second;
    srt(vals);
    reverse(vals.begin(), vals.end());
    ll count = min((ll)vals.size(), s / weight);
    for (int i = 0; i < count; i++) {
      prices.pb(vals[i]);
      weights.pb(weight);
    }
  }

  vn dp(s + 1, 0);
  for (int i = 0; i < weights.size(); i++) {
    for (int j = s; j >= weights[i]; j--) {
      dp[j] = max(dp[j], dp[j - weights[i]] + prices[i]);
    }
  }

  cout << dp[s] << endl;
}

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