#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/tree_policy.hpp>
#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 mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define f first
#define ll long long
#define s second
#define pii pair<int,int>
#define pdd pair<double,double>
#define pll pair<ll,ll>
#define is insert
const long long INF = 1e9;
const long long MOD = 1e9+7;
const int MAXN = 2e5;
//store test cases here
/*
15 5
4 12 1
2 1 1
10 4 1
1 1 1
2 2 1
20 3
5000 15 1
100 1 3
50 1 4
*/
int s,n;
//weight, value
vector<pii> ar;
//vallue, occurences
vector<pii> wg[MAXN];
//max value after considering first j items with total weight i
ll dp[2002][16000];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin>>s>>n;
for(int i=0;i<n;i++){
int v,w,k;cin>>v>>w>>k;
wg[w].pb(mp(v,k));
}
for(int i=1;i<=s;i++){
sort(wg[i].begin(),wg[i].end());
reverse(wg[i].begin(),wg[i].end());
int ct=0;
int ix=0;
while(ct<s/i){
while(ix<wg[i].size()&&wg[i][ix].s==0){
ix++;
}
if(ix==wg[i].size()){
break;
}
ct++;
ar.pb(mp(i,wg[i][ix].f));
wg[i][ix].s--;
}
}
ll as=0;
for(int i=0;i<=ar.size();i++){
for(int j=0;j<=s;j++){
if(i){
dp[j][i]=max(dp[j][i],dp[j][i-1]);
}
if(i<ar.size()&&ar[i].f+j<=s){
dp[ar[i].f+j][i+1]=max(dp[ar[i].f+j][i+1],dp[j][i]+ar[i].s);
}
}
}
cout<<dp[s][ar.size()]<<'\n';
return 0;
}
Compilation message
knapsack.cpp: In function 'int main()':
knapsack.cpp:60:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
60 | while(ix<wg[i].size()&&wg[i][ix].s==0){
| ~~^~~~~~~~~~~~~
knapsack.cpp:63:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
63 | if(ix==wg[i].size()){
| ~~^~~~~~~~~~~~~~
knapsack.cpp:72:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
72 | for(int i=0;i<=ar.size();i++){
| ~^~~~~~~~~~~
knapsack.cpp:77:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
77 | if(i<ar.size()&&ar[i].f+j<=s){
| ~^~~~~~~~~~
knapsack.cpp:71:8: warning: unused variable 'as' [-Wunused-variable]
71 | ll as=0;
| ^~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
10188 KB |
Output is correct |
2 |
Correct |
6 ms |
10180 KB |
Output is correct |
3 |
Correct |
7 ms |
11468 KB |
Output is correct |
4 |
Correct |
6 ms |
10136 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
4940 KB |
Output is correct |
2 |
Correct |
10 ms |
15512 KB |
Output is correct |
3 |
Correct |
13 ms |
15436 KB |
Output is correct |
4 |
Correct |
8 ms |
13468 KB |
Output is correct |
5 |
Correct |
7 ms |
13388 KB |
Output is correct |
6 |
Correct |
10 ms |
15436 KB |
Output is correct |
7 |
Correct |
10 ms |
15488 KB |
Output is correct |
8 |
Correct |
10 ms |
15388 KB |
Output is correct |
9 |
Correct |
11 ms |
15436 KB |
Output is correct |
10 |
Correct |
11 ms |
15436 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
4940 KB |
Output is correct |
2 |
Correct |
10 ms |
15512 KB |
Output is correct |
3 |
Correct |
13 ms |
15436 KB |
Output is correct |
4 |
Correct |
8 ms |
13468 KB |
Output is correct |
5 |
Correct |
7 ms |
13388 KB |
Output is correct |
6 |
Correct |
10 ms |
15436 KB |
Output is correct |
7 |
Correct |
10 ms |
15488 KB |
Output is correct |
8 |
Correct |
10 ms |
15388 KB |
Output is correct |
9 |
Correct |
11 ms |
15436 KB |
Output is correct |
10 |
Correct |
11 ms |
15436 KB |
Output is correct |
11 |
Correct |
3 ms |
4940 KB |
Output is correct |
12 |
Correct |
40 ms |
29508 KB |
Output is correct |
13 |
Correct |
12 ms |
15384 KB |
Output is correct |
14 |
Correct |
8 ms |
13388 KB |
Output is correct |
15 |
Correct |
8 ms |
13388 KB |
Output is correct |
16 |
Correct |
19 ms |
17484 KB |
Output is correct |
17 |
Correct |
11 ms |
15492 KB |
Output is correct |
18 |
Correct |
14 ms |
15436 KB |
Output is correct |
19 |
Correct |
13 ms |
17484 KB |
Output is correct |
20 |
Correct |
15 ms |
15384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
10188 KB |
Output is correct |
2 |
Correct |
6 ms |
10180 KB |
Output is correct |
3 |
Correct |
7 ms |
11468 KB |
Output is correct |
4 |
Correct |
6 ms |
10136 KB |
Output is correct |
5 |
Correct |
3 ms |
4940 KB |
Output is correct |
6 |
Correct |
10 ms |
15512 KB |
Output is correct |
7 |
Correct |
13 ms |
15436 KB |
Output is correct |
8 |
Correct |
8 ms |
13468 KB |
Output is correct |
9 |
Correct |
7 ms |
13388 KB |
Output is correct |
10 |
Correct |
10 ms |
15436 KB |
Output is correct |
11 |
Correct |
10 ms |
15488 KB |
Output is correct |
12 |
Correct |
10 ms |
15388 KB |
Output is correct |
13 |
Correct |
11 ms |
15436 KB |
Output is correct |
14 |
Correct |
11 ms |
15436 KB |
Output is correct |
15 |
Correct |
3 ms |
4940 KB |
Output is correct |
16 |
Correct |
40 ms |
29508 KB |
Output is correct |
17 |
Correct |
12 ms |
15384 KB |
Output is correct |
18 |
Correct |
8 ms |
13388 KB |
Output is correct |
19 |
Correct |
8 ms |
13388 KB |
Output is correct |
20 |
Correct |
19 ms |
17484 KB |
Output is correct |
21 |
Correct |
11 ms |
15492 KB |
Output is correct |
22 |
Correct |
14 ms |
15436 KB |
Output is correct |
23 |
Correct |
13 ms |
17484 KB |
Output is correct |
24 |
Correct |
15 ms |
15384 KB |
Output is correct |
25 |
Correct |
3 ms |
4940 KB |
Output is correct |
26 |
Correct |
71 ms |
45468 KB |
Output is correct |
27 |
Correct |
11 ms |
15436 KB |
Output is correct |
28 |
Correct |
10 ms |
13388 KB |
Output is correct |
29 |
Correct |
8 ms |
13388 KB |
Output is correct |
30 |
Correct |
26 ms |
23500 KB |
Output is correct |
31 |
Correct |
11 ms |
15560 KB |
Output is correct |
32 |
Correct |
11 ms |
15392 KB |
Output is correct |
33 |
Correct |
12 ms |
15436 KB |
Output is correct |
34 |
Correct |
16 ms |
17480 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
10188 KB |
Output is correct |
2 |
Correct |
6 ms |
10180 KB |
Output is correct |
3 |
Correct |
7 ms |
11468 KB |
Output is correct |
4 |
Correct |
6 ms |
10136 KB |
Output is correct |
5 |
Correct |
3 ms |
4940 KB |
Output is correct |
6 |
Correct |
10 ms |
15512 KB |
Output is correct |
7 |
Correct |
13 ms |
15436 KB |
Output is correct |
8 |
Correct |
8 ms |
13468 KB |
Output is correct |
9 |
Correct |
7 ms |
13388 KB |
Output is correct |
10 |
Correct |
10 ms |
15436 KB |
Output is correct |
11 |
Correct |
10 ms |
15488 KB |
Output is correct |
12 |
Correct |
10 ms |
15388 KB |
Output is correct |
13 |
Correct |
11 ms |
15436 KB |
Output is correct |
14 |
Correct |
11 ms |
15436 KB |
Output is correct |
15 |
Correct |
3 ms |
4940 KB |
Output is correct |
16 |
Correct |
40 ms |
29508 KB |
Output is correct |
17 |
Correct |
12 ms |
15384 KB |
Output is correct |
18 |
Correct |
8 ms |
13388 KB |
Output is correct |
19 |
Correct |
8 ms |
13388 KB |
Output is correct |
20 |
Correct |
19 ms |
17484 KB |
Output is correct |
21 |
Correct |
11 ms |
15492 KB |
Output is correct |
22 |
Correct |
14 ms |
15436 KB |
Output is correct |
23 |
Correct |
13 ms |
17484 KB |
Output is correct |
24 |
Correct |
15 ms |
15384 KB |
Output is correct |
25 |
Correct |
3 ms |
4940 KB |
Output is correct |
26 |
Correct |
71 ms |
45468 KB |
Output is correct |
27 |
Correct |
11 ms |
15436 KB |
Output is correct |
28 |
Correct |
10 ms |
13388 KB |
Output is correct |
29 |
Correct |
8 ms |
13388 KB |
Output is correct |
30 |
Correct |
26 ms |
23500 KB |
Output is correct |
31 |
Correct |
11 ms |
15560 KB |
Output is correct |
32 |
Correct |
11 ms |
15392 KB |
Output is correct |
33 |
Correct |
12 ms |
15436 KB |
Output is correct |
34 |
Correct |
16 ms |
17480 KB |
Output is correct |
35 |
Correct |
29 ms |
6944 KB |
Output is correct |
36 |
Correct |
89 ms |
47688 KB |
Output is correct |
37 |
Correct |
85 ms |
47408 KB |
Output is correct |
38 |
Correct |
37 ms |
15796 KB |
Output is correct |
39 |
Correct |
44 ms |
16436 KB |
Output is correct |
40 |
Correct |
509 ms |
258880 KB |
Output is correct |
41 |
Correct |
293 ms |
156112 KB |
Output is correct |
42 |
Correct |
334 ms |
168340 KB |
Output is correct |
43 |
Correct |
472 ms |
258324 KB |
Output is correct |
44 |
Correct |
482 ms |
257808 KB |
Output is correct |
45 |
Correct |
79 ms |
34756 KB |
Output is correct |
46 |
Correct |
46 ms |
16324 KB |
Output is correct |
47 |
Correct |
144 ms |
54980 KB |
Output is correct |
48 |
Correct |
265 ms |
126772 KB |
Output is correct |
49 |
Correct |
44 ms |
18548 KB |
Output is correct |
50 |
Correct |
334 ms |
156608 KB |
Output is correct |