제출 #464839

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

knapsack

#include <bits/stdc++.h>
#define int long long
#define pi pair<int,int>
#define fi first
#define se second
using namespace std;

const int maxN = 1e5+5;
const int maxV = 2e3+5;
int cnt = 0;
pi item[maxN*40]; //.fi = value; .se = weight;
int id[maxN*40];
int baseVal[maxN];
int f[maxV];
int a[maxN];
int S,N;

bool cmp(pi a, pi b){
	return a.se > b.se;
}

signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	//freopen("../test.in","r",stdin);
	cin >> S >> N;
	for(int i = 1; i <= N; ++i){
		int v,w,k; cin >> v >> w >> k;
		for(int j = 1; j <= k; j <<= 1){
			item[++cnt] = pi(v*j,w*j);
			k -= j;
		}
		if(k > 0){
			item[++cnt] = pi(v*k,w*k);
		}
	}
	for(int i = 1; i <= cnt; ++i){
		for(int j = S; j >= item[i].se; --j){
			f[j] = max(f[j], f[j-item[i].se] + item[i].fi);
		}
	}
	cout << f[S] << '\n';
}

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