oj.uz

Submission #502073

# Submission time Handle Problem Language Result Execution time Memory
502073 2022-01-05T08:27:35 Z ditsipandey Knapsack (NOI18_knapsack) C++14
100 / 100
 168 ms 35140 KB 
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>

using std::cout;
using std::endl;
using std::vector;
using std::pair;

int main() {
	int limit;
	int type_num;
	std::cin >> limit >> type_num;
	
	std::map<int, vector<pair<int, int>>> by_weight;
	for (int t = 0; t < type_num; t++) {
		int value;
		int weight;
		int amt;
		std::cin >> value >> weight >> amt;
		if (weight <= limit && amt > 0) {
			by_weight[weight].push_back({value, amt});
		}
	}
	
	/*
	 * best[i][j] contains the most value we can
	 * get using j weight and the first i weight types
	 */
	vector<vector<long long>> best(
		by_weight.size() + 1, vector<long long>(limit + 1, INT32_MIN)
	);
	best[0][0] = 0;
	int at = 1;
	for (auto& [w, items] : by_weight) {
		// sort items in reverse order by value
		std::sort(items.begin(), items.end(), std::greater<pair<int, int>>());
		for (int i = 0; i <= limit; i++) {
			best[at][i] = best[at - 1][i];
			int copies = 0;
			int type_at = 0;
			int curr_used = 0;
			long long profit = 0;
			// go through as many items until we run out of items or usable weight
			while ((copies + 1) * w <= i && type_at < items.size()) {
				copies++;
				profit += items[type_at].first;
				if (best[at - 1][i - copies * w] != INT32_MIN) {
					best[at][i] = std::max(
						best[at][i],
						best[at - 1][i - copies * w] + profit
					);
				}
				
				curr_used++;
				if (curr_used == items[type_at].second) {
					curr_used = 0;
					type_at++;
				}
			}
		}
		at++;
	}
	cout << *std::max_element(best.back().begin(), best.back().end()) << endl;
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:36:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   36 |  for (auto& [w, items] : by_weight) {
      |             ^
knapsack.cpp:46:44: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |    while ((copies + 1) * w <= i && type_at < items.size()) {
      |                                    ~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 268 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 1700 KB Output is correct
7 Correct 2 ms 1832 KB Output is correct
8 Correct 2 ms 1740 KB Output is correct
9 Correct 2 ms 1740 KB Output is correct
10 Correct 3 ms 1700 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 1700 KB Output is correct
7 Correct 2 ms 1832 KB Output is correct
8 Correct 2 ms 1740 KB Output is correct
9 Correct 2 ms 1740 KB Output is correct
10 Correct 3 ms 1700 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 5 ms 296 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 1740 KB Output is correct
17 Correct 1 ms 1736 KB Output is correct
18 Correct 2 ms 1740 KB Output is correct
19 Correct 3 ms 1700 KB Output is correct
20 Correct 2 ms 1868 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 268 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 2 ms 1700 KB Output is correct
11 Correct 2 ms 1832 KB Output is correct
12 Correct 2 ms 1740 KB Output is correct
13 Correct 2 ms 1740 KB Output is correct
14 Correct 3 ms 1700 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 296 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 3 ms 1740 KB Output is correct
21 Correct 1 ms 1736 KB Output is correct
22 Correct 2 ms 1740 KB Output is correct
23 Correct 3 ms 1700 KB Output is correct
24 Correct 2 ms 1868 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 4 ms 288 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 3 ms 1740 KB Output is correct
31 Correct 2 ms 1828 KB Output is correct
32 Correct 2 ms 1740 KB Output is correct
33 Correct 2 ms 1740 KB Output is correct
34 Correct 2 ms 1740 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 268 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 2 ms 1700 KB Output is correct
11 Correct 2 ms 1832 KB Output is correct
12 Correct 2 ms 1740 KB Output is correct
13 Correct 2 ms 1740 KB Output is correct
14 Correct 3 ms 1700 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 5 ms 296 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 3 ms 1740 KB Output is correct
21 Correct 1 ms 1736 KB Output is correct
22 Correct 2 ms 1740 KB Output is correct
23 Correct 3 ms 1700 KB Output is correct
24 Correct 2 ms 1868 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 4 ms 288 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 3 ms 1740 KB Output is correct
31 Correct 2 ms 1828 KB Output is correct
32 Correct 2 ms 1740 KB Output is correct
33 Correct 2 ms 1740 KB Output is correct
34 Correct 2 ms 1740 KB Output is correct
35 Correct 62 ms 2272 KB Output is correct
36 Correct 74 ms 2412 KB Output is correct
37 Correct 82 ms 2228 KB Output is correct
38 Correct 71 ms 2756 KB Output is correct
39 Correct 97 ms 3392 KB Output is correct
40 Correct 158 ms 35140 KB Output is correct
41 Correct 117 ms 34420 KB Output is correct
42 Correct 116 ms 34300 KB Output is correct
43 Correct 168 ms 34332 KB Output is correct
44 Correct 129 ms 34272 KB Output is correct
45 Correct 99 ms 6840 KB Output is correct
46 Correct 88 ms 3164 KB Output is correct
47 Correct 112 ms 9976 KB Output is correct
48 Correct 120 ms 19356 KB Output is correct
49 Correct 86 ms 3816 KB Output is correct
50 Correct 113 ms 3872 KB Output is correct