제출 #465066

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
465066		Qw3rTy	Knapsack (NOI18_knapsack)	C++11	100 / 100	143 ms	9960 KiB

knapsack

#include <bits/stdc++.h>
using ll = long long;
#define pb push_back
using namespace std;
const int maxV = 2e3+5;
vector<ll> d[maxV];
int S,N;
ll f[maxV];
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cin >> S >> N;
	for(int i = 1; i <= N; ++i){
		ll v,w,k; cin >> v >> w >> k;
		for(int j = 1; j <= k; j <<= 1){
			if(w * j > S)break;
			k -= j;
			d[w*j].pb(v*j);
		}
		if(k > 0 && w * k <= S)d[w*k].pb(v*k);
	}
	for(int i = 1; i <= S; ++i){
		if(d[i].size()){ //for each group of objects w/ weight = i
			sort(d[i].begin(),d[i].end(),greater<int>());
			//Consider only the first floor(S/W) objects
			int num = min(S/i,(int)(d[i].size()));
			for(int j = 0; j < num; ++j){
				for(int k = S; k >= i; --k){
					f[k] = max(f[k],f[k-i] + d[i][j]);
				}
			}
		}
	}
	cout << f[S] << '\n';
}

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