oj.uz

Submission #709323

# Submission time Handle Problem Language Result Execution time Memory
709323 2023-03-13T11:22:20 Z nima_aryan Knapsack (NOI18_knapsack) C++17
100 / 100
 108 ms 35320 KB 
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "algo/debug.h"
#endif

using i64 = long long;

int main() {
   ios::sync_with_stdio(false);
   cin.tie(nullptr);
   int limit, type_num;
   cin >> limit >> type_num;
   map<int, vector<pair<int, int>>> by_weight;
   for (int i = 1; i <= type_num; ++i) {
      int value, weight, amount;
      cin >> value >> weight >> amount;
      by_weight[weight].emplace_back(value, amount);
   }
   const i64 inf = 1e18;
   vector best(by_weight.size() + 1, vector<i64>(limit + 1, -inf));
   best[0][0] = 0;
   int at = 1;
   for (auto &[weight, items] : by_weight) {
      sort(items.begin(), items.end(), greater<pair<int, int>>());
      for (int sum = 0; sum <= limit; ++sum) {
         best[at][sum] = best[at - 1][sum];
         int copies = 0, type_at = 0, curr_used = 0;
         i64 profit = 0;
         while ((copies + 1) * weight <= sum && type_at < (int) items.size()) {
            copies += 1;
            profit += items[type_at].first;
            best[at][sum] = max(best[at][sum], best[at - 1][sum - copies * weight] + profit);
            curr_used += 1;
            if (curr_used == items[type_at].second) {
               curr_used = 0;
               type_at += 1;
            }
         }
      }
      at += 1;
   }
   cout << *max_element(best.back().begin(), best.back().end()) << '\n';
}

/* stuff you should look for
 * int overflow, array bounds
 * special cases (n=1?)
 * do smth instead of nothing and stay organized
 * WRITE STUFF DOWN
 * DON'T GET STUCK ON ONE APPROACH
 */

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 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 1 ms 212 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 2 ms 1748 KB Output is correct
7 Correct 2 ms 1876 KB Output is correct
8 Correct 2 ms 1748 KB Output is correct
9 Correct 2 ms 1748 KB Output is correct
10 Correct 2 ms 1748 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 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 2 ms 1748 KB Output is correct
7 Correct 2 ms 1876 KB Output is correct
8 Correct 2 ms 1748 KB Output is correct
9 Correct 2 ms 1748 KB Output is correct
10 Correct 2 ms 1748 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 352 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 2 ms 1748 KB Output is correct
17 Correct 2 ms 1748 KB Output is correct
18 Correct 2 ms 1748 KB Output is correct
19 Correct 3 ms 1748 KB Output is correct
20 Correct 2 ms 1876 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 0 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 1 ms 212 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 0 ms 340 KB Output is correct
10 Correct 2 ms 1748 KB Output is correct
11 Correct 2 ms 1876 KB Output is correct
12 Correct 2 ms 1748 KB Output is correct
13 Correct 2 ms 1748 KB Output is correct
14 Correct 2 ms 1748 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 6 ms 352 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 2 ms 1748 KB Output is correct
21 Correct 2 ms 1748 KB Output is correct
22 Correct 2 ms 1748 KB Output is correct
23 Correct 3 ms 1748 KB Output is correct
24 Correct 2 ms 1876 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 7 ms 360 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 3 ms 1876 KB Output is correct
31 Correct 2 ms 1876 KB Output is correct
32 Correct 2 ms 1748 KB Output is correct
33 Correct 2 ms 1748 KB Output is correct
34 Correct 2 ms 1748 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 0 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 1 ms 212 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 0 ms 340 KB Output is correct
10 Correct 2 ms 1748 KB Output is correct
11 Correct 2 ms 1876 KB Output is correct
12 Correct 2 ms 1748 KB Output is correct
13 Correct 2 ms 1748 KB Output is correct
14 Correct 2 ms 1748 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 6 ms 352 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 2 ms 1748 KB Output is correct
21 Correct 2 ms 1748 KB Output is correct
22 Correct 2 ms 1748 KB Output is correct
23 Correct 3 ms 1748 KB Output is correct
24 Correct 2 ms 1876 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 7 ms 360 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 3 ms 1876 KB Output is correct
31 Correct 2 ms 1876 KB Output is correct
32 Correct 2 ms 1748 KB Output is correct
33 Correct 2 ms 1748 KB Output is correct
34 Correct 2 ms 1748 KB Output is correct
35 Correct 25 ms 1492 KB Output is correct
36 Correct 35 ms 2516 KB Output is correct
37 Correct 32 ms 2260 KB Output is correct
38 Correct 29 ms 2640 KB Output is correct
39 Correct 35 ms 3288 KB Output is correct
40 Correct 108 ms 35320 KB Output is correct
41 Correct 81 ms 34444 KB Output is correct
42 Correct 82 ms 34380 KB Output is correct
43 Correct 101 ms 34472 KB Output is correct
44 Correct 92 ms 34208 KB Output is correct
45 Correct 44 ms 6880 KB Output is correct
46 Correct 34 ms 3184 KB Output is correct
47 Correct 48 ms 10028 KB Output is correct
48 Correct 69 ms 19376 KB Output is correct
49 Correct 32 ms 3916 KB Output is correct
50 Correct 62 ms 3948 KB Output is correct