oj.uz

Submission #674294

# Submission time Handle Problem Language Result Execution time Memory
674294 2022-12-23T16:37:40 Z ThinGarfield Knapsack (NOI18_knapsack) C++11
100 / 100
 204 ms 43096 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define mp make_pair
#define F first
#define S second

constexpr int maxs = 2e3 + 5;

int n, s;

vector<pii> items[maxs];  // items[i] = all items (val, ct) with weight i, sort by val
ll vadd[maxs][maxs];      // vadd[i][j] = value added by taking j items of weight i
ll dp[maxs][maxs];        // dp[i][j] = best value from i-sized basket w/ only items of weight <= j

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

  cin >> s >> n;
  for (int i = 1; i <= n; i++) {
    int v, w, k;
    cin >> v >> w >> k;
    items[w].push_back(mp(v, k));
  }

  for (int i = 1; i <= s; i++) {
    sort(items[i].rbegin(), items[i].rend());
    int ct = 1;
    for (pii it : items[i]) {
      for (int j = 0; j < it.S && ct <= s / i; j++, ct++) {
        vadd[i][ct] = vadd[i][ct - 1] + it.F;
      }
    }
    // cout << i << " : ";
    // for (int j = 0; j <= ct; j++) {
    //   cout << vadd[i][j] << ' ';
    // }
    // cout << '\n';
  }

  for (int i = 1; i <= s; i++) {
    for (int j = 1; j <= s; j++) {
      dp[i][j] = dp[i][j - 1];
      for (int k = 1; j * k <= i && vadd[j][k] != 0; k++) {
        dp[i][j] = max(dp[i][j], dp[i - j * k][j - 1] + vadd[j][k]);
      }
      // cout << dp[i][j] << ' ';
    }
    // cout << '\n';
  }

  cout << dp[s][s] << '\n';

  return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 17236 KB Output is correct
2 Correct 12 ms 17232 KB Output is correct
3 Correct 16 ms 17184 KB Output is correct
4 Correct 12 ms 17236 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 28 ms 31692 KB Output is correct
3 Correct 28 ms 31664 KB Output is correct
4 Correct 26 ms 31692 KB Output is correct
5 Correct 31 ms 31764 KB Output is correct
6 Correct 34 ms 32072 KB Output is correct
7 Correct 34 ms 32144 KB Output is correct
8 Correct 37 ms 32120 KB Output is correct
9 Correct 38 ms 32160 KB Output is correct
10 Correct 33 ms 32048 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 28 ms 31692 KB Output is correct
3 Correct 28 ms 31664 KB Output is correct
4 Correct 26 ms 31692 KB Output is correct
5 Correct 31 ms 31764 KB Output is correct
6 Correct 34 ms 32072 KB Output is correct
7 Correct 34 ms 32144 KB Output is correct
8 Correct 37 ms 32120 KB Output is correct
9 Correct 38 ms 32160 KB Output is correct
10 Correct 33 ms 32048 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 42 ms 31776 KB Output is correct
13 Correct 28 ms 31692 KB Output is correct
14 Correct 27 ms 31800 KB Output is correct
15 Correct 31 ms 31636 KB Output is correct
16 Correct 37 ms 32076 KB Output is correct
17 Correct 33 ms 32060 KB Output is correct
18 Correct 34 ms 32092 KB Output is correct
19 Correct 39 ms 32128 KB Output is correct
20 Correct 35 ms 32120 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 17236 KB Output is correct
2 Correct 12 ms 17232 KB Output is correct
3 Correct 16 ms 17184 KB Output is correct
4 Correct 12 ms 17236 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 28 ms 31692 KB Output is correct
7 Correct 28 ms 31664 KB Output is correct
8 Correct 26 ms 31692 KB Output is correct
9 Correct 31 ms 31764 KB Output is correct
10 Correct 34 ms 32072 KB Output is correct
11 Correct 34 ms 32144 KB Output is correct
12 Correct 37 ms 32120 KB Output is correct
13 Correct 38 ms 32160 KB Output is correct
14 Correct 33 ms 32048 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 42 ms 31776 KB Output is correct
17 Correct 28 ms 31692 KB Output is correct
18 Correct 27 ms 31800 KB Output is correct
19 Correct 31 ms 31636 KB Output is correct
20 Correct 37 ms 32076 KB Output is correct
21 Correct 33 ms 32060 KB Output is correct
22 Correct 34 ms 32092 KB Output is correct
23 Correct 39 ms 32128 KB Output is correct
24 Correct 35 ms 32120 KB Output is correct
25 Correct 1 ms 356 KB Output is correct
26 Correct 46 ms 31748 KB Output is correct
27 Correct 27 ms 31692 KB Output is correct
28 Correct 26 ms 31684 KB Output is correct
29 Correct 26 ms 31672 KB Output is correct
30 Correct 42 ms 32124 KB Output is correct
31 Correct 31 ms 32104 KB Output is correct
32 Correct 40 ms 32072 KB Output is correct
33 Correct 39 ms 32072 KB Output is correct
34 Correct 36 ms 32124 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 17236 KB Output is correct
2 Correct 12 ms 17232 KB Output is correct
3 Correct 16 ms 17184 KB Output is correct
4 Correct 12 ms 17236 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 28 ms 31692 KB Output is correct
7 Correct 28 ms 31664 KB Output is correct
8 Correct 26 ms 31692 KB Output is correct
9 Correct 31 ms 31764 KB Output is correct
10 Correct 34 ms 32072 KB Output is correct
11 Correct 34 ms 32144 KB Output is correct
12 Correct 37 ms 32120 KB Output is correct
13 Correct 38 ms 32160 KB Output is correct
14 Correct 33 ms 32048 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 42 ms 31776 KB Output is correct
17 Correct 28 ms 31692 KB Output is correct
18 Correct 27 ms 31800 KB Output is correct
19 Correct 31 ms 31636 KB Output is correct
20 Correct 37 ms 32076 KB Output is correct
21 Correct 33 ms 32060 KB Output is correct
22 Correct 34 ms 32092 KB Output is correct
23 Correct 39 ms 32128 KB Output is correct
24 Correct 35 ms 32120 KB Output is correct
25 Correct 1 ms 356 KB Output is correct
26 Correct 46 ms 31748 KB Output is correct
27 Correct 27 ms 31692 KB Output is correct
28 Correct 26 ms 31684 KB Output is correct
29 Correct 26 ms 31672 KB Output is correct
30 Correct 42 ms 32124 KB Output is correct
31 Correct 31 ms 32104 KB Output is correct
32 Correct 40 ms 32072 KB Output is correct
33 Correct 39 ms 32072 KB Output is correct
34 Correct 36 ms 32124 KB Output is correct
35 Correct 68 ms 2308 KB Output is correct
36 Correct 119 ms 33936 KB Output is correct
37 Correct 129 ms 33696 KB Output is correct
38 Correct 96 ms 33992 KB Output is correct
39 Correct 120 ms 34780 KB Output is correct
40 Correct 204 ms 43096 KB Output is correct
41 Correct 154 ms 42260 KB Output is correct
42 Correct 162 ms 42272 KB Output is correct
43 Correct 189 ms 42304 KB Output is correct
44 Correct 188 ms 42276 KB Output is correct
45 Correct 128 ms 35928 KB Output is correct
46 Correct 120 ms 34576 KB Output is correct
47 Correct 160 ms 36752 KB Output is correct
48 Correct 165 ms 39056 KB Output is correct
49 Correct 108 ms 35020 KB Output is correct
50 Correct 154 ms 34920 KB Output is correct