oj.uz

Submission #620188

# Submission time Handle Problem Language Result Execution time Memory
620188 2022-08-03T03:11:12 Z ThinGarfield Knapsack (NOI18_knapsack) C++11
100 / 100
 135 ms 3784 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define pb push_back
#define mp make_pair
#define F first
#define S second

constexpr int maxn = 100005;
constexpr int maxs = 2005;

int n, s;

vector<pii> items_list[maxs];  // items[w] = [all pairs (v, k) with value w]
vector<pii> items;             // items = list of (value,weight), sorted, at most s/w items per w

int knapsack() {
  int N = items.size();
  int K[2][maxs];

  for (int i = 0; i <= N; i++) {
    for (int w = 0; w <= s; w++) {
      if (i == 0 || w == 0)
        K[i % 2][w] = 0;
      else if (items[i - 1].S <= w)
        K[i % 2][w] = max(items[i - 1].F + K[(i - 1) % 2][w - items[i - 1].S], K[(i - 1) % 2][w]);
      else
        K[i % 2][w] = K[(i - 1) % 2][w];
    }
  }
  return K[N % 2][s];
}

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

  cin >> s >> n;
  for (int i = 0; i < n; i++) {
    int v, w, k;
    cin >> v >> w >> k;
    items_list[w].pb(mp(v, k));
  }
  for (int i = 1; i <= s; i++) {
    // sort by value
    sort(items_list[i].begin(), items_list[i].end(), greater<pii>());

    // add items to items
    int counter = 0;
    for (pii item_type : items_list[i]) {
      for (int j = 0; j < item_type.S; j++) {
        if (counter == s / i) break;
        items.push_back(mp(item_type.F, i));
        counter++;
      }
    }
  }

  // for (pii item : items) {
  //   cout << "value: " << item.F << '\t' << "weight: " << item.S << '\n';
  // }

  cout << knapsack() << '\n';

  return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 352 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 352 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 9 ms 392 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 2 ms 340 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 352 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 352 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 9 ms 392 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 2 ms 340 KB Output is correct
35 Correct 75 ms 2256 KB Output is correct
36 Correct 78 ms 2552 KB Output is correct
37 Correct 73 ms 2372 KB Output is correct
38 Correct 79 ms 2776 KB Output is correct
39 Correct 94 ms 3356 KB Output is correct
40 Correct 135 ms 3784 KB Output is correct
41 Correct 100 ms 2952 KB Output is correct
42 Correct 100 ms 3096 KB Output is correct
43 Correct 119 ms 2972 KB Output is correct
44 Correct 116 ms 2984 KB Output is correct
45 Correct 94 ms 3672 KB Output is correct
46 Correct 93 ms 3196 KB Output is correct
47 Correct 96 ms 3688 KB Output is correct
48 Correct 112 ms 3580 KB Output is correct
49 Correct 88 ms 3388 KB Output is correct
50 Correct 113 ms 3480 KB Output is correct