제출 #848056

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
848056		_hbk06	Knapsack (NOI18_knapsack)	C++14	100 / 100	100 ms	16724 KiB

knapsack

#include<bits/stdc++.h>

using namespace std;
#define TASK "task"
#define all(x) (x).begin(),(x).end()
#define int long long
const int mxN = 5e5 + 7;

template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
     if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
     if (a < b) {a = b; return true;} return false;
}

int n;
int m;
int dp[mxN];
vector<pair<int,int>>weight[mxN];

signed main() {
	//freopen(TASK".inp","r",stdin);
	//freopen(TASK".out","w",stdout);
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		int v,w,k;
		cin >> v >> w >> k;
		weight[w].emplace_back(make_pair(v,k));
	}
	for (int i = 1; i <= n; i++) sort(all(weight[i]),greater<pair<int,int>>());
	for (int i = 1; i <= n; i++) {
		if((int) weight[i].size() == 0) continue;
		int cur = 0;
		for (int j = 0; j * i < n; j++) {
			if(cur >= (int) weight[i].size()) break;
			for (int k = n; k >= i; k--) maximize(dp[k],dp[k - i] + weight[i][cur].first);
			weight[i][cur].second--;
			if(!weight[i][cur].second) ++cur;
		}
	}
	cout << dp[n] << "\n";
	return 0;
}

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