Submission #1183614

#	Time	Username	Problem	Language	Result	Execution time	Memory
1183614		lioow	Knapsack (NOI18_knapsack)	C++20	100 / 100	30 ms	2888 KiB

knapsack

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define int long long
#define repp(i,x,n) for(int i=x;i<=n;i++)
#define rep(i,x,n) for(int i=x;i>=n;i--)
#define cy cout<<"YES"<<endl
#define cn cout<<"NO"<<endl
#define r0 return 0
#define fi first
#define se second
#define liow ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define jelek cout<<"jelek"<<endl
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define pi pair<pair<int,int>,pair<int,int>>
#define p3 pair<int,pair<int,int>>
#define p2
#define tp tuple<int,int,int>
#define fl fflush(stdout)
#define lb long double
#define p5 pair<int,pair<pair<int,int>,pair<int,int>>>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")  
using namespace std;
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<pair<int,int>, null_type,  less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
const int mod=1e9+7,maxn=2e5+5,N=5e5+5,INF=1e18;
const int MOD=998244353;
//const int MOD=1e6+3;
mt19937_64 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());
pii dir[8]={{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1}};

void solve(){
	int s,n;cin>>s>>n;
	vector<int>dp(s+2,0);
	vector<pii>a[s+2];
	repp(i,1,n){
		int v,w,k;cin>>v>>w>>k;
		a[w].pb({v,k});
	}
	repp(i,1,s){
		int maks=s/i;
		vector<int>nw;
		sort(all(a[i]),greater<pii>());
		for(auto[v,k]:a[i]){
			while(k>0 && nw.size()<maks){
				nw.pb(v);
				k--;
			}
		}
		for(auto v:nw){
			for(int j=s;j>=i;j--) dp[j]=max(dp[j],dp[j-i]+v);
		}
	}
	cout<<dp[s]<<endl;
}


signed main(){
  liow;
  int t=1;
// cin>>t;
  while(t--){
  	solve();
  }
}

• Subtask 1: 12 / 12
• Subtask 2: 17 / 17
• Subtask 3: 20 / 20
• Subtask 4: 24 / 24
• Subtask 5: 27 / 27