Submission #938878

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
938878	2024-03-05T17:52:48 Z	andrewp	Knapsack (NOI18_knapsack)	C++14	100 / 100	45 ms	5128 KB

knapsack

//Dedicated to my love, ivaziva
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define here cerr<<"---------------------------------\n"
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#include "bits/stdc++.h"
#define ll long long
#define ld long double
#define llinf 100000000000000000LL
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define all(a) a.begin(),a.end()
#define sz(s) (ll)(s.size())
#define ios ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);
#define mod 1000000007
using namespace std;
/*#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<int,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
ll add(ll x,ll y){
    if(x+y>=mod) return x+y-mod;
    return x+y;
}
ll sub(ll x,ll y){
    if(x-y<0) return x-y+mod;
    return x-y;
}
ll mul(ll x,ll y){
    ll res=(x*y)%mod;
    if(res<0) res+=mod;
    return res;
}
ll pw(ll x,ll y){
	ll ret=1,bs=x;
	for(;y;y>>=1){
		if(y&1) ret=mul(ret,bs);
		bs=mul(bs,bs);
	}
	return ret%mod;
}*/
#define maxn 2005
ll n,s;
ll v[maxn],w[maxn];
vector<pll> c[maxn];
ll dp[maxn];
void tc(){
    cin >> s >> n;
    for(ll i = 1;i<=n;i++){
        ll vu,wu,k;
        cin >> vu >> wu >> k;
        c[wu].pb({vu,k});
    }
    for(ll i = 0;i<=s;i++) dp[i]=-llinf;
    dp[0]=0;
    for(ll i = 1;i<=s;i++){
        if(sz(c[i])==0) continue;
        sort(c[i].rbegin(),c[i].rend());
        ll mx=s/i;
        for(ll j = 0;j<sz(c[i]);j++){
            if(!mx) break;
            for(ll p = 0;p<c[i][j].second;p++){
                if(!mx) break;
                mx--;
                for(ll k = s;k>=i;k--) dp[k]=max(dp[k],dp[k-i]+c[i][j].fi);
            }
        }
    }
    ll ans=0;
    for(ll i = 0;i<=s;i++) ans=max(ans,dp[i]);
    cout<<ans<<endl;
}
int main(){
	ios
    int t; t = 1;
//    cin >> t;
    while(t--){
        tc();
    }
	return 0;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
17.0 / 17.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
24.0 / 24.0

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

Subtask #5
27.0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	2 ms	344 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	3 ms	344 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	520 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	1 ms	344 KB	Output is correct
35	Correct	22 ms	3544 KB	Output is correct
36	Correct	27 ms	3540 KB	Output is correct
37	Correct	25 ms	3544 KB	Output is correct
38	Correct	23 ms	3768 KB	Output is correct
39	Correct	26 ms	4364 KB	Output is correct
40	Correct	45 ms	4844 KB	Output is correct
41	Correct	31 ms	3932 KB	Output is correct
42	Correct	32 ms	3932 KB	Output is correct
43	Correct	40 ms	4184 KB	Output is correct
44	Correct	40 ms	3916 KB	Output is correct
45	Correct	25 ms	4688 KB	Output is correct
46	Correct	27 ms	4056 KB	Output is correct
47	Correct	28 ms	5128 KB	Output is correct
48	Correct	33 ms	4836 KB	Output is correct
49	Correct	24 ms	4700 KB	Output is correct
50	Correct	38 ms	4188 KB	Output is correct

Submission #938878

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 17.0 / 17.0

Subtask #3 20.0 / 20.0

Subtask #4 24.0 / 24.0

Subtask #5 27.0 / 27.0

Subtask #1
12.0 / 12.0

Subtask #2
17.0 / 17.0

Subtask #3
20.0 / 20.0

Subtask #4
24.0 / 24.0

Subtask #5
27.0 / 27.0