oj.uz

Submission #514819

# Submission time Handle Problem Language Result Execution time Memory
514819 2022-01-18T14:14:35 Z karthikhegde05 Knapsack (NOI18_knapsack) C++17
100 / 100
 122 ms 4932 KB 
#include<bits/stdc++.h>
using namespace std;


#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T> using Tree = tree<T, null_type, less<T>, 
    rb_tree_tag, tree_order_statistics_node_update>;

#define ook order_of_key
#define fbo find_by_order

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef vector<long long> vll;
#define PI acos(-1.0)
#define EPS 1e-9
#define INF 1000000000
#define setbits(x)      __builtin_popcountll(x)
#define zrobits(x)      __builtin_ctzll(x)
#define pb push_back
#define mkp make_pair
#define sqr(a) ((a) * (a))
#define sz(a) int((a).size())
#define all(a) (a).begin(), (a).end()
#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define FOR(i, l, r) for(int i=int(l); i<=int(r); i++)
#define ROF(i, l, r) for(int i=int(r); i>=int(l); --i)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7;

void print_out(int x){
    cout<<"Case #"<<x<<": ";
}



int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int n, S; cin>>S>>n;

    vector<vector<pair<ll, ll>>> V(S+2);
    vll K(S+2, 0);
    FOR(i, 0, n-1){
    
        ll v, w, k;cin>>v>>w>>k;
        V[w].pb({v, k});
        K[w]+=k;
    }

    for(int i=0; i<=S; i++){
        if(!V[i].empty())sort(all(V[i]), [&](pair<ll, ll>& x, pair<ll, ll>& y){return x.first>y.first;});

        for(int j=1; j<sz(V[i]); j++){
            V[i][j].second += V[i][j-1].second;
        }
    }



    
    vll dp(S+2, 0);
    
    for(int i=1; i<=S; i++){
        for(int x=S; x>=0; x--){
            ll val = 0;int ptr = 0;
            for(int k=1; k<=K[i]; k++){
                
                if(x+k*i>S)break;
                if(k>V[i][ptr].second)ptr++;
                if(ptr>=sz(V[i]))break;
                val += V[i][ptr].first;

                dp[x+k*i] = max(dp[x+k*i], dp[x]+val);
            }
        }
    }

    ll ans = 0;
    for(int x=S; x>=0; x--){
        ans = max(ans, dp[x]);
    }

    cout<<ans<<"\n";

    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 332 KB Output is correct
2 Correct 4 ms 332 KB Output is correct
3 Correct 5 ms 360 KB Output is correct
4 Correct 4 ms 332 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 12 ms 396 KB Output is correct
3 Correct 13 ms 396 KB Output is correct
4 Correct 10 ms 388 KB Output is correct
5 Correct 11 ms 332 KB Output is correct
6 Correct 11 ms 332 KB Output is correct
7 Correct 12 ms 396 KB Output is correct
8 Correct 12 ms 332 KB Output is correct
9 Correct 11 ms 392 KB Output is correct
10 Correct 11 ms 388 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 12 ms 396 KB Output is correct
3 Correct 13 ms 396 KB Output is correct
4 Correct 10 ms 388 KB Output is correct
5 Correct 11 ms 332 KB Output is correct
6 Correct 11 ms 332 KB Output is correct
7 Correct 12 ms 396 KB Output is correct
8 Correct 12 ms 332 KB Output is correct
9 Correct 11 ms 392 KB Output is correct
10 Correct 11 ms 388 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 16 ms 332 KB Output is correct
13 Correct 12 ms 392 KB Output is correct
14 Correct 11 ms 332 KB Output is correct
15 Correct 11 ms 392 KB Output is correct
16 Correct 14 ms 396 KB Output is correct
17 Correct 11 ms 332 KB Output is correct
18 Correct 10 ms 332 KB Output is correct
19 Correct 10 ms 332 KB Output is correct
20 Correct 11 ms 332 KB Output is correct

Subtask #4
24.0 / 24.0

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

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 332 KB Output is correct
2 Correct 4 ms 332 KB Output is correct
3 Correct 5 ms 360 KB Output is correct
4 Correct 4 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 12 ms 396 KB Output is correct
7 Correct 13 ms 396 KB Output is correct
8 Correct 10 ms 388 KB Output is correct
9 Correct 11 ms 332 KB Output is correct
10 Correct 11 ms 332 KB Output is correct
11 Correct 12 ms 396 KB Output is correct
12 Correct 12 ms 332 KB Output is correct
13 Correct 11 ms 392 KB Output is correct
14 Correct 11 ms 388 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 16 ms 332 KB Output is correct
17 Correct 12 ms 392 KB Output is correct
18 Correct 11 ms 332 KB Output is correct
19 Correct 11 ms 392 KB Output is correct
20 Correct 14 ms 396 KB Output is correct
21 Correct 11 ms 332 KB Output is correct
22 Correct 10 ms 332 KB Output is correct
23 Correct 10 ms 332 KB Output is correct
24 Correct 11 ms 332 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 20 ms 400 KB Output is correct
27 Correct 11 ms 332 KB Output is correct
28 Correct 10 ms 396 KB Output is correct
29 Correct 11 ms 404 KB Output is correct
30 Correct 12 ms 396 KB Output is correct
31 Correct 10 ms 392 KB Output is correct
32 Correct 11 ms 392 KB Output is correct
33 Correct 11 ms 332 KB Output is correct
34 Correct 11 ms 332 KB Output is correct
35 Correct 29 ms 2448 KB Output is correct
36 Correct 54 ms 2516 KB Output is correct
37 Correct 47 ms 3380 KB Output is correct
38 Correct 43 ms 3620 KB Output is correct
39 Correct 59 ms 4340 KB Output is correct
40 Correct 122 ms 4772 KB Output is correct
41 Correct 67 ms 4052 KB Output is correct
42 Correct 76 ms 3936 KB Output is correct
43 Correct 106 ms 4008 KB Output is correct
44 Correct 106 ms 4004 KB Output is correct
45 Correct 55 ms 4720 KB Output is correct
46 Correct 36 ms 4008 KB Output is correct
47 Correct 56 ms 4932 KB Output is correct
48 Correct 70 ms 4596 KB Output is correct
49 Correct 38 ms 4424 KB Output is correct
50 Correct 96 ms 4180 KB Output is correct