제출 #654282

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
654282		thiago_bastos	Knapsack (NOI18_knapsack)	C++17	73 / 100	1095 ms	584 KiB

knapsack

#include "bits/stdc++.h"

using namespace std;

#define INF 2000000100
#define INFLL 1000000000000000000ll
#define EPS 1e-9
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define pb push_back
#define fi first
#define sc second
 
using i64 = long long;
using u64 = unsigned long long;
using ld = long double;
using ii = pair<int, int>;	

const int N = 2e3 + 100;

int dp[N];
ii dq[N];

void solve() {
	int s, n;

	cin >> s >> n;

	fill(dp, dp + N, -INF);

	dp[0] = 0;

	for(int i = 0; i < n; ++i) {
		int v, w, c;

		cin >> v >> w >> c;

		c = min(c, s / w);

		for(int k = 0; k < w; ++k) {
			int lo = 0, hi = 0;

			for(int j = k; j <= s; j += w) {
				int l = (j - k) / w, X = -INF;

				while(lo < hi && l - dq[lo].sc > c) ++lo;

				if(lo != hi) X = dq[lo].fi + v * l;

				if(dp[j] >= 0) {
					while(lo < hi && dq[hi - 1].fi < dp[j] - v * l) --hi;
					dq[hi++] = {dp[j] - v * l, l};
				}

				dp[j] = max(dp[j], X);
			}
		}
	}

	cout << *max_element(dp, dp + N) << '\n';
}	

int main() {
	ios_base :: sync_with_stdio(false);
	cin.tie(0);
	int t = 1;
 //	cin >> t;
	while(t--) solve();
	return 0;
}

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