oj.uz

Submission #484425

# Submission time Handle Problem Language Result Execution time Memory
484425 2021-11-03T10:20:40 Z MOHITSINGHAL Knapsack (NOI18_knapsack) C++17
100 / 100
 66 ms 7364 KB 
/* Author:- Mohit Singhal */

#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define PI 3.14159265
#define ll long long
#define vii vector<int, int>
#define vll vector<long long, long long>
#define vi vector<int>
#define vl vector<long long>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// define ordered_multiset tree< pair<int,int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update>
// define ordered_set tree< int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>


int main(){
    fastio;
    ll s, n;
    cin >> s >> n;
    ll v[n], w[n], k[n];
    for(int i = 0;i<n;i++){
        cin >> v[i] >> w[i] >> k[i];
    }

    priority_queue<pair<ll, ll>> pq[s+1];
    
    for(int i = 0;i<n;i++){
        pq[w[i]].push({v[i], k[i]});
    }


    vector<ll> values[s+1];
    for(int i = 1;i<=s;i++){
        values[i].push_back(0);
        ll currValue = 0;
        ll currWeight = i;
        while(pq[i].size() > 0 && currWeight <= s){
            pair<ll, ll> p = pq[i].top();
            currValue+= p.first;
            values[i].push_back(currValue);
            currWeight+=i;
            p.second--;
            pq[i].pop();
            if(p.second > 0)
                pq[i].push(p);
        }
    }


    ll dp[s+1][2];
    for(int i = 0;i<=s;i++){
        dp[i][0] = 0;
    }

    dp[0][1] = 0;

    // for(int i = 1;i<=s;i++){
    //     for(auto ele: values[i]){
    //         cout << ele << " ";
    //     }
    //     cout << endl;
    // }


    for(int i = 1;i<=s;i++){
        for(int j = 1;j<=s;j++){
            dp[j][i%2] = dp[j][(i+1)%2];
            int k = 1;
            while(k < values[i].size() && j - i*k >= 0){
                dp[j][i%2] = max(dp[j][i%2], dp[j - i*k][(i+1)%2] + values[i][k])  ;
                k++;
            }
        }
        // cout << dp[s][i%2] << endl;
    }

    cout << dp[s][s%2] << endl;

}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:73:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |             while(k < values[i].size() && j - i*k >= 0){
      |                   ~~^~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
17.0 / 17.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
24.0 / 24.0

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

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 4 ms 460 KB Output is correct
7 Correct 4 ms 460 KB Output is correct
8 Correct 3 ms 460 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 460 KB Output is correct
13 Correct 4 ms 460 KB Output is correct
14 Correct 4 ms 460 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 6 ms 460 KB Output is correct
17 Correct 3 ms 460 KB Output is correct
18 Correct 4 ms 460 KB Output is correct
19 Correct 3 ms 460 KB Output is correct
20 Correct 3 ms 460 KB Output is correct
21 Correct 4 ms 460 KB Output is correct
22 Correct 3 ms 460 KB Output is correct
23 Correct 4 ms 460 KB Output is correct
24 Correct 4 ms 460 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 6 ms 460 KB Output is correct
27 Correct 3 ms 460 KB Output is correct
28 Correct 3 ms 460 KB Output is correct
29 Correct 3 ms 460 KB Output is correct
30 Correct 4 ms 460 KB Output is correct
31 Correct 3 ms 460 KB Output is correct
32 Correct 4 ms 460 KB Output is correct
33 Correct 3 ms 460 KB Output is correct
34 Correct 3 ms 460 KB Output is correct
35 Correct 20 ms 5832 KB Output is correct
36 Correct 32 ms 6180 KB Output is correct
37 Correct 25 ms 5960 KB Output is correct
38 Correct 32 ms 6056 KB Output is correct
39 Correct 32 ms 6668 KB Output is correct
40 Correct 66 ms 7116 KB Output is correct
41 Correct 39 ms 6344 KB Output is correct
42 Correct 41 ms 6340 KB Output is correct
43 Correct 43 ms 6468 KB Output is correct
44 Correct 47 ms 6468 KB Output is correct
45 Correct 45 ms 7116 KB Output is correct
46 Correct 32 ms 6724 KB Output is correct
47 Correct 46 ms 7364 KB Output is correct
48 Correct 40 ms 7108 KB Output is correct
49 Correct 32 ms 6860 KB Output is correct
50 Correct 39 ms 6640 KB Output is correct