oj.uz

Submission #767229

# Submission time Handle Problem Language Result Execution time Memory
767229 2023-06-26T14:21:21 Z jabeznguyen Knapsack (NOI18_knapsack) C++14
100 / 100
 116 ms 35152 KB 
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T>
using ordered_set = tree<T,null_type,less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FORE(i,v) for (__typeof((v).begin()) i=(v).begin();i!=(v).end();i++)
#define f(i,a,b) for(int i=int (a);i<=int (b);i++)
#define ff(i,a,b) for(int i=int (a);i<int (b);i++)
#define F(i,a,b) for(int i=int (a);i>=int (b);i--)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define fi first
#define se second
#define ll long long
#define ld long double
#define pll pair<ll,ll>
#define all(x) x.begin(),x.end()
#define lower(p,x) lower_bound(all(p),x)
#define upper(p,x) upper_bound(all(p),x)
#define ms(a,x) memset(a,x,sizeof (a))
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
const double eps=1e-9,pi=acos(-1.0);
const int N=1e6+6,inf=0x3f3f3f3f,mod=1e9+7;
int main()
{
    int s,n;
    cin>>s>>n;
    map<int,vector<pair<int,int>>> by_weight;
    ff(i,0,n)
    {
        int v,w,k;
        cin>>v>>w>>k;
        by_weight[w].pb({v,k});
    }
    vector<vector<ll>> b(by_weight.size()+1,vector<ll>(s+1,INT32_MIN));
    b[0][0]=0;
    int att=1;
    for(auto &[w,items]: by_weight){
        sort(items.begin(),items.end(),greater<pair<int,int>>());
        for(int i=0;i<=s;i++){
            b[att][i]=b[att-1][i];
            int copies=0;
            int type_att=0;
            ll value=0;
            int cur_used=0;
            while((copies+1)*w<=i&&type_att<items.size()){
                copies++;
                value+=items[type_att].fi;
                if(b[att-1][i-copies*w]!=INT32_MIN)
                    b[att][i]=max(b[att][i],b[att-1][i-copies*w]+value);
                cur_used++;
                if(cur_used==items[type_att].se){
                    type_att++;
                    cur_used=0;
                }
            }
        }
        att++;
    }
    cout<<*max_element(b.back().begin(),b.back().end());
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:44:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   44 |     for(auto &[w,items]: by_weight){
      |               ^
knapsack.cpp:52:44: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |             while((copies+1)*w<=i&&type_att<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 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 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 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 1748 KB Output is correct
7 Correct 1 ms 1748 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 1 ms 1748 KB Output is correct
10 Correct 1 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 1 ms 340 KB Output is correct
6 Correct 1 ms 1748 KB Output is correct
7 Correct 1 ms 1748 KB Output is correct
8 Correct 1 ms 1748 KB Output is correct
9 Correct 1 ms 1748 KB Output is correct
10 Correct 1 ms 1748 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 1748 KB Output is correct
17 Correct 1 ms 1700 KB Output is correct
18 Correct 1 ms 1748 KB Output is correct
19 Correct 2 ms 1748 KB Output is correct
20 Correct 2 ms 1776 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 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 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 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 1748 KB Output is correct
11 Correct 1 ms 1748 KB Output is correct
12 Correct 1 ms 1748 KB Output is correct
13 Correct 1 ms 1748 KB Output is correct
14 Correct 1 ms 1748 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 1748 KB Output is correct
21 Correct 1 ms 1700 KB Output is correct
22 Correct 1 ms 1748 KB Output is correct
23 Correct 2 ms 1748 KB Output is correct
24 Correct 2 ms 1776 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 3 ms 348 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 2 ms 1748 KB Output is correct
31 Correct 1 ms 1748 KB Output is correct
32 Correct 1 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 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 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 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 1748 KB Output is correct
11 Correct 1 ms 1748 KB Output is correct
12 Correct 1 ms 1748 KB Output is correct
13 Correct 1 ms 1748 KB Output is correct
14 Correct 1 ms 1748 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 1748 KB Output is correct
21 Correct 1 ms 1700 KB Output is correct
22 Correct 1 ms 1748 KB Output is correct
23 Correct 2 ms 1748 KB Output is correct
24 Correct 2 ms 1776 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 3 ms 348 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 2 ms 1748 KB Output is correct
31 Correct 1 ms 1748 KB Output is correct
32 Correct 1 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 51 ms 1348 KB Output is correct
36 Correct 59 ms 2488 KB Output is correct
37 Correct 53 ms 2244 KB Output is correct
38 Correct 67 ms 2672 KB Output is correct
39 Correct 73 ms 3284 KB Output is correct
40 Correct 116 ms 35152 KB Output is correct
41 Correct 94 ms 34392 KB Output is correct
42 Correct 92 ms 34356 KB Output is correct
43 Correct 99 ms 34452 KB Output is correct
44 Correct 103 ms 34316 KB Output is correct
45 Correct 82 ms 6776 KB Output is correct
46 Correct 74 ms 3040 KB Output is correct
47 Correct 81 ms 9992 KB Output is correct
48 Correct 108 ms 19264 KB Output is correct
49 Correct 82 ms 3864 KB Output is correct
50 Correct 104 ms 4000 KB Output is correct