제출 #475838

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
475838		vishnu_sujith	Knapsack (NOI18_knapsack)	C++17	100 / 100	438 ms	35268 KiB

knapsack

#include <bits/stdc++.h>

using namespace std;

#ifdef DEBUG
#define LOG(...) cerr << "[" << #__VA_ARGS__ << "]: " << repr(__VA_ARGS__) << endl;
#define MSG(args) cerr << args << "\n";
#define debug(x) x
#else
#define LOG(...)
#define MSG(args)
#define debug(x)
#endif

#define mp make_pair
#define pb push_back
#define sz(x) (int((x).size()))
#define ms(x, v) memset((x), v, sizeof(x))
#define all(x) (x).begin(), (x).end()
#define endl '\n'

using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<pii>;
using vvi = vector<vi>;

int S, n;
map<int, vii> mpp;
ll memo[2001][2001];

ll solve(int cur, int rem) {
  if (cur > S || rem <= 0) return 0LL;
  else if (memo[cur][rem] != -1) return memo[cur][rem];

  ll now = 0, value = 0;
  ll res = solve(cur + 1, rem);
  for (auto [v, k] : mpp[cur]) {
    while (k--) {
      now += cur;
      value += v;
      if (now > rem)
        break;
      res = max(res, solve(cur + 1, rem - now) + value);
    }

    if (now > rem)
      break;
  }
  return memo[cur][rem] = res;
}

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

  ms(memo, 0xff);

  cin >> S >> n;
  for (int i = 0; i < n; ++i) {
    int v, w, k; cin >> v >> w >> k;
    if (w <= S) {
      mpp[w].pb({v, k});
    }
  }

  for (int i = 1; i <= S; ++i)
    sort(all(mpp[i]), greater<pii>());

  cout << solve(1, S) << endl;

  
  return 0;
}

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