oj.uz

Submission #467861

# Submission time Handle Problem Language Result Execution time Memory
467861 2021-08-25T02:10:02 Z rainliofficial Knapsack (NOI18_knapsack) C++17
100 / 100
 133 ms 35772 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

struct Item{
    int v, w, k;
    bool operator<(const Item& o) const{
        return o.v < v;
    };
};

const int MAXN = 1e5 + 5, MAXS = 2000 + 5;
int maxW, n;
map<int, vector<Item>> arr;
ll dp[MAXS][MAXS];

int main(){
    cin.tie(0)->sync_with_stdio(0);
    //freopen("file.in", "r", stdin);
    cin >> maxW >> n;
    for (int i=0; i<n; i++){
        int v, w, k;
        cin >> v >> w >> k;
        if (arr.find(w) == arr.end()){
            arr.insert({w, vector<Item>()});
        }
        arr[w].push_back({v, w, k});
    }
    int weightGroup = 1;
    for (auto currW : arr){
        vector<Item> curr = currW.second;
        sort(curr.begin(), curr.end());
        int id = 0;
        for (int i=0; i<=maxW; i++){
            dp[weightGroup][i] = dp[weightGroup-1][i];
            int sum = 0;
            // Try to use as many of this current weightGroup as possible
            int copies = 0;
            int ind = 0;
            int totCopies = 1;
            while (ind < curr.size()){
                if (totCopies * currW.first > i){
                    break;
                }
                if (copies >= curr[ind].k){
                    ind++;
                    copies = 0;
                }
                if (ind >= curr.size()){
                    break;
                }
                sum += curr[ind].v;
                dp[weightGroup][i] = max(dp[weightGroup][i], dp[weightGroup-1][i - totCopies * currW.first] + sum);
                copies++;
                totCopies++;
            }
        }
        weightGroup++;
    }
    /*for (int i=1; i<weightGroup; i++){
        for (int j=0; j<=maxW; j++){
            cout << dp[i][j] << " ";
        }
        cout << "\n";
    }*/
    ll ans = 0;
    for (int i=0; i<=maxW; i++){
        ans = max(ans, dp[weightGroup-1][i]);
    }
    cout << ans << '\n';
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:41:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Item>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |             while (ind < curr.size()){
      |                    ~~~~^~~~~~~~~~~~~
knapsack.cpp:49:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Item>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |                 if (ind >= curr.size()){
      |                     ~~~~^~~~~~~~~~~~~~
knapsack.cpp:33:13: warning: unused variable 'id' [-Wunused-variable]
   33 |         int id = 0;
      |             ^~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 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 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 1740 KB Output is correct
7 Correct 2 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 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 1740 KB Output is correct
7 Correct 2 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 0 ms 332 KB Output is correct
12 Correct 7 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 2 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 2 ms 1740 KB Output is correct
20 Correct 2 ms 1868 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 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 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 2 ms 1740 KB Output is correct
11 Correct 2 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 0 ms 332 KB Output is correct
16 Correct 7 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 2 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 2 ms 1740 KB Output is correct
24 Correct 2 ms 1868 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 9 ms 336 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 4 ms 1740 KB Output is correct
31 Correct 2 ms 1868 KB Output is correct
32 Correct 2 ms 1740 KB Output is correct
33 Correct 2 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 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 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 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 2 ms 1740 KB Output is correct
11 Correct 2 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 0 ms 332 KB Output is correct
16 Correct 7 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 2 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 2 ms 1740 KB Output is correct
24 Correct 2 ms 1868 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 9 ms 336 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 4 ms 1740 KB Output is correct
31 Correct 2 ms 1868 KB Output is correct
32 Correct 2 ms 1740 KB Output is correct
33 Correct 2 ms 1740 KB Output is correct
34 Correct 3 ms 1740 KB Output is correct
35 Correct 35 ms 3864 KB Output is correct
36 Correct 47 ms 3896 KB Output is correct
37 Correct 45 ms 5052 KB Output is correct
38 Correct 40 ms 3412 KB Output is correct
39 Correct 48 ms 4176 KB Output is correct
40 Correct 133 ms 35772 KB Output is correct
41 Correct 111 ms 35148 KB Output is correct
42 Correct 101 ms 34948 KB Output is correct
43 Correct 122 ms 34980 KB Output is correct
44 Correct 121 ms 34948 KB Output is correct
45 Correct 55 ms 7364 KB Output is correct
46 Correct 38 ms 5924 KB Output is correct
47 Correct 66 ms 10568 KB Output is correct
48 Correct 116 ms 19908 KB Output is correct
49 Correct 40 ms 4412 KB Output is correct
50 Correct 79 ms 4516 KB Output is correct