oj.uz

Submission #847309

# Submission time Handle Problem Language Result Execution time Memory
847309 2023-09-09T13:03:21 Z vjudge1 Knapsack (NOI18_knapsack) C++14
100 / 100
 32 ms 3416 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long
#define isz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

using ld = long double;
const int inf = 2e18;
const ld eps = 1e-9;

const int N = 1e5 + 5;
const int S = 2e3 + 1;

int n, s;
vector<pair<int, int>> items[S];
int dp[S];

signed main() {
  ios::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].emplace_back(v, k);
  }
  vector<array<int, 3>> a;
  for (int i = 1; i <= s; ++i) {
    sort(all(items[i]), greater<>());
    int bound = s / i;
    for (pair<int, int> it: items[i]) {
      int v, k; tie(v, k) = it;
      int taken = min(bound, k);
      a.push_back({i, v, taken});
      bound -= taken;
      if (bound == 0) {
        break;
      }
    }
  }
  vector<pair<int, int>> b;
  for (int i = 0; i < isz(a); ++i) {
    int w = a[i][0], v = a[i][1], k = a[i][2];
    int pw2 = 1;
    while (pw2 <= k) {
      b.emplace_back(w * pw2, v * pw2);
      k -= pw2;
      pw2 *= 2;
    }
    if (k > 0) {
      b.emplace_back(w * k, v * k);
    }
  }
  for (pair<int, int> it: b) {
    int w, v; tie(w, v) = it;

    for (int i = s; i >= w; --i) {
      dp[i] = max(dp[i], dp[i - w] + v);
    }
  }
  int ans = -inf;
  for (int i = 0; i <= s; ++i) {
    ans = max(ans, dp[i]);
  }
  cout << ans;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
17.0 / 17.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
24.0 / 24.0

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

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 392 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 21 ms 2516 KB Output is correct
36 Correct 25 ms 2716 KB Output is correct
37 Correct 25 ms 2520 KB Output is correct
38 Correct 22 ms 2900 KB Output is correct
39 Correct 26 ms 2324 KB Output is correct
40 Correct 27 ms 3012 KB Output is correct
41 Correct 31 ms 3416 KB Output is correct
42 Correct 32 ms 3304 KB Output is correct
43 Correct 28 ms 3164 KB Output is correct
44 Correct 26 ms 3072 KB Output is correct
45 Correct 24 ms 2652 KB Output is correct
46 Correct 26 ms 2520 KB Output is correct
47 Correct 25 ms 2900 KB Output is correct
48 Correct 26 ms 2788 KB Output is correct
49 Correct 23 ms 2904 KB Output is correct
50 Correct 24 ms 2396 KB Output is correct