oj.uz

Submission #475837

# Submission time Handle Problem Language Result Execution time Memory
475837 2021-09-24T08:19:33 Z vishnu_sujith Knapsack (NOI18_knapsack) C++17
73 / 100
 1000 ms 35244 KB 
#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];

  sort(all(mpp[cur]), greater<pii>());
  ll res = 0, now = 0, value = 0;
  res = max(res, solve(cur + 1, rem));
  for (const auto &e : mpp[cur]) {
    for (int i = 1; i <= e.second; ++i) {
      now += cur;
      value += 1LL * e.first;
      if (now <= rem) {
        res = max(res, solve(cur + 1, rem - now) + value);
      } else {
        break;
      }
    }
    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});
    }
  }
  cout << solve(1, S) << endl;

  return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 31792 KB Output is correct
2 Correct 13 ms 31788 KB Output is correct
3 Correct 35 ms 31784 KB Output is correct
4 Correct 13 ms 31876 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 31664 KB Output is correct
2 Correct 42 ms 32012 KB Output is correct
3 Correct 41 ms 31952 KB Output is correct
4 Correct 14 ms 32028 KB Output is correct
5 Correct 14 ms 32000 KB Output is correct
6 Correct 499 ms 32012 KB Output is correct
7 Correct 542 ms 32008 KB Output is correct
8 Correct 472 ms 32012 KB Output is correct
9 Correct 544 ms 32068 KB Output is correct
10 Correct 585 ms 32016 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 31664 KB Output is correct
2 Correct 42 ms 32012 KB Output is correct
3 Correct 41 ms 31952 KB Output is correct
4 Correct 14 ms 32028 KB Output is correct
5 Correct 14 ms 32000 KB Output is correct
6 Correct 499 ms 32012 KB Output is correct
7 Correct 542 ms 32008 KB Output is correct
8 Correct 472 ms 32012 KB Output is correct
9 Correct 544 ms 32068 KB Output is correct
10 Correct 585 ms 32016 KB Output is correct
11 Correct 13 ms 31556 KB Output is correct
12 Correct 312 ms 32020 KB Output is correct
13 Correct 42 ms 32028 KB Output is correct
14 Correct 17 ms 31948 KB Output is correct
15 Correct 14 ms 31940 KB Output is correct
16 Correct 573 ms 32020 KB Output is correct
17 Correct 624 ms 32012 KB Output is correct
18 Correct 519 ms 32016 KB Output is correct
19 Correct 635 ms 32016 KB Output is correct
20 Correct 680 ms 31948 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 31792 KB Output is correct
2 Correct 13 ms 31788 KB Output is correct
3 Correct 35 ms 31784 KB Output is correct
4 Correct 13 ms 31876 KB Output is correct
5 Correct 12 ms 31664 KB Output is correct
6 Correct 42 ms 32012 KB Output is correct
7 Correct 41 ms 31952 KB Output is correct
8 Correct 14 ms 32028 KB Output is correct
9 Correct 14 ms 32000 KB Output is correct
10 Correct 499 ms 32012 KB Output is correct
11 Correct 542 ms 32008 KB Output is correct
12 Correct 472 ms 32012 KB Output is correct
13 Correct 544 ms 32068 KB Output is correct
14 Correct 585 ms 32016 KB Output is correct
15 Correct 13 ms 31556 KB Output is correct
16 Correct 312 ms 32020 KB Output is correct
17 Correct 42 ms 32028 KB Output is correct
18 Correct 17 ms 31948 KB Output is correct
19 Correct 14 ms 31940 KB Output is correct
20 Correct 573 ms 32020 KB Output is correct
21 Correct 624 ms 32012 KB Output is correct
22 Correct 519 ms 32016 KB Output is correct
23 Correct 635 ms 32016 KB Output is correct
24 Correct 680 ms 31948 KB Output is correct
25 Correct 13 ms 31564 KB Output is correct
26 Correct 618 ms 32008 KB Output is correct
27 Correct 42 ms 31948 KB Output is correct
28 Correct 13 ms 31956 KB Output is correct
29 Correct 14 ms 31908 KB Output is correct
30 Correct 688 ms 32016 KB Output is correct
31 Correct 533 ms 32012 KB Output is correct
32 Correct 495 ms 31916 KB Output is correct
33 Correct 546 ms 32016 KB Output is correct
34 Correct 547 ms 32016 KB Output is correct

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 31792 KB Output is correct
2 Correct 13 ms 31788 KB Output is correct
3 Correct 35 ms 31784 KB Output is correct
4 Correct 13 ms 31876 KB Output is correct
5 Correct 12 ms 31664 KB Output is correct
6 Correct 42 ms 32012 KB Output is correct
7 Correct 41 ms 31952 KB Output is correct
8 Correct 14 ms 32028 KB Output is correct
9 Correct 14 ms 32000 KB Output is correct
10 Correct 499 ms 32012 KB Output is correct
11 Correct 542 ms 32008 KB Output is correct
12 Correct 472 ms 32012 KB Output is correct
13 Correct 544 ms 32068 KB Output is correct
14 Correct 585 ms 32016 KB Output is correct
15 Correct 13 ms 31556 KB Output is correct
16 Correct 312 ms 32020 KB Output is correct
17 Correct 42 ms 32028 KB Output is correct
18 Correct 17 ms 31948 KB Output is correct
19 Correct 14 ms 31940 KB Output is correct
20 Correct 573 ms 32020 KB Output is correct
21 Correct 624 ms 32012 KB Output is correct
22 Correct 519 ms 32016 KB Output is correct
23 Correct 635 ms 32016 KB Output is correct
24 Correct 680 ms 31948 KB Output is correct
25 Correct 13 ms 31564 KB Output is correct
26 Correct 618 ms 32008 KB Output is correct
27 Correct 42 ms 31948 KB Output is correct
28 Correct 13 ms 31956 KB Output is correct
29 Correct 14 ms 31908 KB Output is correct
30 Correct 688 ms 32016 KB Output is correct
31 Correct 533 ms 32012 KB Output is correct
32 Correct 495 ms 31916 KB Output is correct
33 Correct 546 ms 32016 KB Output is correct
34 Correct 547 ms 32016 KB Output is correct
35 Correct 57 ms 33732 KB Output is correct
36 Correct 647 ms 34004 KB Output is correct
37 Correct 685 ms 33832 KB Output is correct
38 Correct 55 ms 34172 KB Output is correct
39 Correct 71 ms 34852 KB Output is correct
40 Execution timed out 1093 ms 35244 KB Time limit exceeded
41 Halted 0 ms 0 KB -