oj.uz

Submission #931286

# Submission time Handle Problem Language Result Execution time Memory
931286 2024-02-21T14:19:06 Z mannshah1211 Knapsack (NOI18_knapsack) C++17
100 / 100
 66 ms 7872 KB 
/*
 * Plat on the Open.
 */

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define pb push_back

using T = pair<int, int>;

void solve() {
	int s, n;
	cin >> s >> n;
	vector<int> v(n), w(n), k(n);
	vector<vector<T>> buckets(s + 1);
	for (int i = 0; i < n; i++) {
		cin >> v[i] >> w[i] >> k[i];
		buckets[w[i]].pb({v[i], k[i]});
	}
	vector<vector<T>> items(s + 1);
	for (int i = 1; i <= s; i++) sort(all(buckets[i])), reverse(all(buckets[i]));
	for (int i = 1; i <= s; i++) {
		int sz = buckets[i].size();
		vector<int> psums_vals(sz + 1), psums_items(sz + 1);
		for (int j = 1; j <= sz; j++) {
			auto [x, y] = buckets[i][j - 1];
			psums_vals[j] = psums_vals[j - 1] + (x * y);
			psums_items[j] = psums_items[j - 1] + y;
		}
		for (int j = i; j <= min(i * psums_items[sz], s); j += i) {
			int needed_items = j / i;
			int lo = 0, hi = sz, ind = -1;
			while (lo <= hi) {
				int mid = (lo + hi) / 2;
				if (psums_items[mid] <= needed_items) {
					ind = mid;
					lo = mid + 1;
				} else {
					hi = mid - 1;
				}
			}
			if (ind != -1) {
				int x = (ind == sz) ? 0 : buckets[i][ind].f;
				int val = psums_vals[ind] + ((needed_items - psums_items[ind]) * x);
				items[i].pb(make_pair(j, val));
			} else {
				assert(0);
				int val = needed_items * buckets[i][0].f;
				items[i].pb(make_pair(j, val));
			}
		}
	}
	vector<int> dp(s + 1, 0), ndp(s + 1, 0);
	for (int i = 1; i <= s; i++) {
		for (int j = 0; j <= s; j++) {
			ndp[j] = dp[j];
			if (j >= 1) ndp[j] = max(ndp[j], ndp[j - 1]);
			for (auto& [weight, val] : items[i]) {
				if (j >= weight) {
					ndp[j] = max(ndp[j], dp[j - weight] + val);
				}
			}
		}
		swap(ndp, dp);
	}
	cout << dp[s] << '\n';
}

int32_t main() {
	ios::sync_with_stdio(false); cin.tie(0);
	int tt = 1;
	// cin >> tt;
	while (tt--) {
		solve();
	}
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 452 KB Output is correct
2 Correct 13 ms 588 KB Output is correct
3 Correct 13 ms 348 KB Output is correct
4 Correct 13 ms 584 KB Output is correct
5 Correct 13 ms 552 KB Output is correct
6 Correct 13 ms 348 KB Output is correct
7 Correct 13 ms 592 KB Output is correct
8 Correct 13 ms 344 KB Output is correct
9 Correct 13 ms 596 KB Output is correct
10 Correct 13 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 452 KB Output is correct
2 Correct 13 ms 588 KB Output is correct
3 Correct 13 ms 348 KB Output is correct
4 Correct 13 ms 584 KB Output is correct
5 Correct 13 ms 552 KB Output is correct
6 Correct 13 ms 348 KB Output is correct
7 Correct 13 ms 592 KB Output is correct
8 Correct 13 ms 344 KB Output is correct
9 Correct 13 ms 596 KB Output is correct
10 Correct 13 ms 348 KB Output is correct
11 Correct 0 ms 600 KB Output is correct
12 Correct 15 ms 604 KB Output is correct
13 Correct 13 ms 348 KB Output is correct
14 Correct 13 ms 348 KB Output is correct
15 Correct 13 ms 348 KB Output is correct
16 Correct 13 ms 344 KB Output is correct
17 Correct 13 ms 592 KB Output is correct
18 Correct 13 ms 348 KB Output is correct
19 Correct 13 ms 348 KB Output is correct
20 Correct 13 ms 348 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 13 ms 588 KB Output is correct
7 Correct 13 ms 348 KB Output is correct
8 Correct 13 ms 584 KB Output is correct
9 Correct 13 ms 552 KB Output is correct
10 Correct 13 ms 348 KB Output is correct
11 Correct 13 ms 592 KB Output is correct
12 Correct 13 ms 344 KB Output is correct
13 Correct 13 ms 596 KB Output is correct
14 Correct 13 ms 348 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 15 ms 604 KB Output is correct
17 Correct 13 ms 348 KB Output is correct
18 Correct 13 ms 348 KB Output is correct
19 Correct 13 ms 348 KB Output is correct
20 Correct 13 ms 344 KB Output is correct
21 Correct 13 ms 592 KB Output is correct
22 Correct 13 ms 348 KB Output is correct
23 Correct 13 ms 348 KB Output is correct
24 Correct 13 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 19 ms 612 KB Output is correct
27 Correct 13 ms 348 KB Output is correct
28 Correct 13 ms 584 KB Output is correct
29 Correct 13 ms 348 KB Output is correct
30 Correct 14 ms 800 KB Output is correct
31 Correct 13 ms 592 KB Output is correct
32 Correct 13 ms 348 KB Output is correct
33 Correct 13 ms 348 KB Output is correct
34 Correct 13 ms 596 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 13 ms 588 KB Output is correct
7 Correct 13 ms 348 KB Output is correct
8 Correct 13 ms 584 KB Output is correct
9 Correct 13 ms 552 KB Output is correct
10 Correct 13 ms 348 KB Output is correct
11 Correct 13 ms 592 KB Output is correct
12 Correct 13 ms 344 KB Output is correct
13 Correct 13 ms 596 KB Output is correct
14 Correct 13 ms 348 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 15 ms 604 KB Output is correct
17 Correct 13 ms 348 KB Output is correct
18 Correct 13 ms 348 KB Output is correct
19 Correct 13 ms 348 KB Output is correct
20 Correct 13 ms 344 KB Output is correct
21 Correct 13 ms 592 KB Output is correct
22 Correct 13 ms 348 KB Output is correct
23 Correct 13 ms 348 KB Output is correct
24 Correct 13 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 19 ms 612 KB Output is correct
27 Correct 13 ms 348 KB Output is correct
28 Correct 13 ms 584 KB Output is correct
29 Correct 13 ms 348 KB Output is correct
30 Correct 14 ms 800 KB Output is correct
31 Correct 13 ms 592 KB Output is correct
32 Correct 13 ms 348 KB Output is correct
33 Correct 13 ms 348 KB Output is correct
34 Correct 13 ms 596 KB Output is correct
35 Correct 24 ms 6872 KB Output is correct
36 Correct 40 ms 7364 KB Output is correct
37 Correct 40 ms 7108 KB Output is correct
38 Correct 39 ms 6200 KB Output is correct
39 Correct 40 ms 6980 KB Output is correct
40 Correct 66 ms 7480 KB Output is correct
41 Correct 46 ms 6588 KB Output is correct
42 Correct 50 ms 6480 KB Output is correct
43 Correct 57 ms 6544 KB Output is correct
44 Correct 57 ms 6484 KB Output is correct
45 Correct 39 ms 7256 KB Output is correct
46 Correct 41 ms 7872 KB Output is correct
47 Correct 41 ms 7524 KB Output is correct
48 Correct 54 ms 7316 KB Output is correct
49 Correct 37 ms 6992 KB Output is correct
50 Correct 53 ms 6752 KB Output is correct