oj.uz

Submission #643400

# Submission time Handle Problem Language Result Execution time Memory
643400 2022-09-22T01:47:10 Z VISHNUCODE Knapsack (NOI18_knapsack) C++14
100 / 100
 155 ms 35248 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <climits>
using namespace std;
int main(){
    int limit; int N; cin >> limit >> N;
    // group by weights
    map<int,vector<pair<int,int> > > weight_groups; //value,amount
    for(int i = 0;i < N;i++){
        int value; int weight; int amt; cin >> value >> weight >> amt;
        if(amt > 0 && limit >= weight){
            weight_groups[weight].push_back(make_pair(value,amt));
        }
    }
    vector<vector<long long > > best(weight_groups.size()+1,vector<long long> (limit+1,INT_MIN));
    //best [i][j] = max value you can get choosing the first i weight groups and spending at most j money
    best[0][0] = 0;
    int i = 1;
    for(auto&[w,items] : weight_groups){
        //sort weight groups in reverse order cuz you want the best value if you have the same weight lol
        sort(items.begin(),items.end(),greater<pair<int,int> >());
        for(int j = 0;j <= limit;j++){
            best[i][j] = best[i-1][j];
            int kthcopy = 0;
            int typecounter = 0;
            int curr_used = 0;
            long long profit = 0;
            //keep picking till you run out of options or run out of weight
            while((kthcopy + 1)* w <= j && typecounter < items.size()){
                kthcopy++;
                profit += items[typecounter].first;
                if(best[i-1][j-(kthcopy*w)] != INT_MIN){
                    best[i][j] = max(best[i][j],best[i-1][j-(kthcopy*w)] + profit);
                }
                curr_used++;
                if(curr_used == items[typecounter].second){
                    curr_used = 0;
                    typecounter++;
                }
            }
        }
        i++;
    }
    cout << *std::max_element(best.back().begin(), best.back().end()) << endl;
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:21:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   21 |     for(auto&[w,items] : weight_groups){
      |              ^
knapsack.cpp:31:56: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |             while((kthcopy + 1)* w <= j && typecounter < items.size()){
      |                                            ~~~~~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 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 300 KB Output is correct
5 Correct 1 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 3 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 300 KB Output is correct
5 Correct 1 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 3 ms 1748 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 3 ms 300 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 1840 KB Output is correct
17 Correct 2 ms 1748 KB Output is correct
18 Correct 2 ms 1844 KB Output is correct
19 Correct 2 ms 1748 KB Output is correct
20 Correct 2 ms 1832 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 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 300 KB Output is correct
9 Correct 1 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 3 ms 1748 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 3 ms 300 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 1840 KB Output is correct
21 Correct 2 ms 1748 KB Output is correct
22 Correct 2 ms 1844 KB Output is correct
23 Correct 2 ms 1748 KB Output is correct
24 Correct 2 ms 1832 KB Output is correct
25 Correct 1 ms 300 KB Output is correct
26 Correct 5 ms 340 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 1748 KB Output is correct
31 Correct 2 ms 1876 KB Output is correct
32 Correct 2 ms 1704 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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 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 300 KB Output is correct
9 Correct 1 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 3 ms 1748 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 3 ms 300 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 1840 KB Output is correct
21 Correct 2 ms 1748 KB Output is correct
22 Correct 2 ms 1844 KB Output is correct
23 Correct 2 ms 1748 KB Output is correct
24 Correct 2 ms 1832 KB Output is correct
25 Correct 1 ms 300 KB Output is correct
26 Correct 5 ms 340 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 1748 KB Output is correct
31 Correct 2 ms 1876 KB Output is correct
32 Correct 2 ms 1704 KB Output is correct
33 Correct 2 ms 1748 KB Output is correct
34 Correct 2 ms 1748 KB Output is correct
35 Correct 61 ms 2284 KB Output is correct
36 Correct 71 ms 2444 KB Output is correct
37 Correct 69 ms 2296 KB Output is correct
38 Correct 74 ms 2692 KB Output is correct
39 Correct 93 ms 3264 KB Output is correct
40 Correct 155 ms 35248 KB Output is correct
41 Correct 119 ms 34316 KB Output is correct
42 Correct 149 ms 34420 KB Output is correct
43 Correct 133 ms 34388 KB Output is correct
44 Correct 133 ms 34304 KB Output is correct
45 Correct 96 ms 6732 KB Output is correct
46 Correct 90 ms 3048 KB Output is correct
47 Correct 120 ms 9996 KB Output is correct
48 Correct 121 ms 19368 KB Output is correct
49 Correct 92 ms 3820 KB Output is correct
50 Correct 114 ms 3996 KB Output is correct