oj.uz

Submission #409909

# Submission time Handle Problem Language Result Execution time Memory
409909 2021-05-21T18:57:10 Z SansPapyrus683 Knapsack (NOI18_knapsack) C++17
100 / 100
 203 ms 35068 KB 
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>

using std::cout;
using std::endl;
using std::vector;
using std::pair;

/**
 * https://oj.uz/problem/view/NOI18_knapsack
 * 15 5
 * 4 12 1
 * 2 1 1
 * 10 4 1
 * 1 1 1
 * 2 2 1 should output 15
 */
int main() {
    int limit;  // max is 2000
    int type_num;  // max is 100k
    std::cin >> limit >> type_num;
    
    std::map<int, vector<pair<int, int>>> by_weight;
    for (int t = 0; t < type_num; t++) {
        int value;
        int weight;
        int amt;
        std::cin >> value >> weight >> amt;
        if (weight <= limit && 0 < amt) {
            by_weight[weight].push_back({value, amt});
        }
    }
   
    vector<vector<long long>> best(by_weight.size() + 1,
                                      vector<long long>(limit + 1, INT32_MIN));
    best[0][0] = 0;
    int at = 1;
    for (auto& [w, items] : by_weight) {
        std::sort(items.begin(), items.end(), std::greater<pair<int, int>>());
        for (int i = 0; i <= limit; i++) {
            best[at][i] = best[at - 1][i];
            int copies = 0;
            int type_at = 0;
            int curr_used = 0;
            long long profit = 0;
            while ((copies + 1) * w <= i && type_at < items.size()) {
                copies++;
                profit += items[type_at].first;
                if (best[at - 1][i - copies * w] != INT32_MIN) {
                    best[at][i] = std::max(best[at][i], best[at - 1][i - copies * w] + profit);
                }
                
                curr_used++;
                if (curr_used == items[type_at].second) {
                    curr_used = 0;
                    type_at++;
                }
            }
        }
        at++;
        // break;
    }
    cout << *std::max_element(std::begin(best.back()),
                              std::end(best.back())) << endl;
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:48:53: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |             while ((copies + 1) * w <= i && type_at < items.size()) {
      |                                             ~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 400 KB Output is correct
6 Correct 4 ms 1740 KB Output is correct
7 Correct 3 ms 1868 KB Output is correct
8 Correct 2 ms 1740 KB Output is correct
9 Correct 2 ms 1740 KB Output is correct
10 Correct 2 ms 1740 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 400 KB Output is correct
6 Correct 4 ms 1740 KB Output is correct
7 Correct 3 ms 1868 KB Output is correct
8 Correct 2 ms 1740 KB Output is correct
9 Correct 2 ms 1740 KB Output is correct
10 Correct 2 ms 1740 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 4 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 1740 KB Output is correct
17 Correct 2 ms 1740 KB Output is correct
18 Correct 2 ms 1740 KB Output is correct
19 Correct 3 ms 1824 KB Output is correct
20 Correct 3 ms 1828 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 400 KB Output is correct
10 Correct 4 ms 1740 KB Output is correct
11 Correct 3 ms 1868 KB Output is correct
12 Correct 2 ms 1740 KB Output is correct
13 Correct 2 ms 1740 KB Output is correct
14 Correct 2 ms 1740 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 4 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 3 ms 1740 KB Output is correct
21 Correct 2 ms 1740 KB Output is correct
22 Correct 2 ms 1740 KB Output is correct
23 Correct 3 ms 1824 KB Output is correct
24 Correct 3 ms 1828 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 5 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 4 ms 1740 KB Output is correct
31 Correct 3 ms 1868 KB Output is correct
32 Correct 3 ms 1820 KB Output is correct
33 Correct 3 ms 1740 KB Output is correct
34 Correct 3 ms 1740 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 400 KB Output is correct
10 Correct 4 ms 1740 KB Output is correct
11 Correct 3 ms 1868 KB Output is correct
12 Correct 2 ms 1740 KB Output is correct
13 Correct 2 ms 1740 KB Output is correct
14 Correct 2 ms 1740 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 4 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 3 ms 1740 KB Output is correct
21 Correct 2 ms 1740 KB Output is correct
22 Correct 2 ms 1740 KB Output is correct
23 Correct 3 ms 1824 KB Output is correct
24 Correct 3 ms 1828 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 5 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 4 ms 1740 KB Output is correct
31 Correct 3 ms 1868 KB Output is correct
32 Correct 3 ms 1820 KB Output is correct
33 Correct 3 ms 1740 KB Output is correct
34 Correct 3 ms 1740 KB Output is correct
35 Correct 80 ms 2296 KB Output is correct
36 Correct 98 ms 2500 KB Output is correct
37 Correct 85 ms 2228 KB Output is correct
38 Correct 93 ms 2620 KB Output is correct
39 Correct 132 ms 3292 KB Output is correct
40 Correct 203 ms 35068 KB Output is correct
41 Correct 174 ms 34500 KB Output is correct
42 Correct 153 ms 34408 KB Output is correct
43 Correct 177 ms 34400 KB Output is correct
44 Correct 172 ms 34324 KB Output is correct
45 Correct 123 ms 6724 KB Output is correct
46 Correct 112 ms 3128 KB Output is correct
47 Correct 130 ms 9980 KB Output is correct
48 Correct 157 ms 19396 KB Output is correct
49 Correct 117 ms 3908 KB Output is correct
50 Correct 144 ms 3980 KB Output is correct