제출 #1289186

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1289186		m.zeeshanrashid	Knapsack (NOI18_knapsack)	C++20	100 / 100	160 ms	246480 KiB

knapsack

#ifdef __AVX2__
#pragma GCC target "avx2"
#endif
#pragma GCC optimize "O3"
#pragma GCC optimize "unroll-loops"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds; 
using namespace std;
#define int long long
#define elif else if
#define all(l) begin(l),end(l)
#define rall(l) rbegin(l),rend(l)
#define append push_back
#define print(l) for(auto i:l) cout<<i<<' '; cout<<endl;
#define pprint(a,b) cout<<a<<' '<<b<<endl;
#define inp(l) for(auto &i:l) cin>>i;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pai make_pair
#define endl "\n"
#define pii pair<int,int>
#define fi first
#define se second
#define vec vector

// const int mod=998244353;
const int mod1=998244353;
const int mod=1e9+7;
const int N=2e5+5;

int iter=1,itera=1;
void solve(){
	int s,n;
	cin>>s>>n;
	vec<vec<pii>>val(s+1);
	for(int i=0;i<n;i++){
		int v,w,k;
		cin>>v>>w>>k;
		val[w].append({v,k});
	}
	vec<pii>kn;
	for(int i=1;i<=s;i++){
		sort(rall(val[i]));
		int c=0;
		for(auto pa:val[i]){
			if(c==s/i) break;
			for(int j=0;j<pa.se;j++){
				c++;
				kn.append({i,pa.fi});
				if(c==s/i) break;
			}
		}
	}
	n=kn.size();
	vec<vec<int>>w(n+1,vec<int>(s+1,0));
	int ans=0;
	for(int i=1;i<=n;i++){
		int v=kn[i-1].se,we=kn[i-1].fi;
		for(int j=0;j<=s;j++){
			w[i][j]=w[i-1][j];
			if(j>=we) w[i][j]=max(w[i][j],w[i-1][j-we]+v);
			ans=max(ans,w[i][j]);
		}
	}
	cout<<ans<<endl;
}
signed main(){
	// freopen("","r",stdin);
	// freopen("","w",stdout);
	ios_base::sync_with_stdio(false);
	cin.tie(NULL); 
	cout.tie(NULL);
	cout<<fixed<<setprecision(20);
	// cin>>itera;
	for(iter=1;iter<=itera;iter++) solve();
}

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