Submission #540137

# Submission time Handle Problem Language Result Execution time Memory
540137 2022-03-19T11:08:06 Z oneskovic Knapsack (NOI18_knapsack) C++14
100 / 100
209 ms 35396 KB
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <vector>
using namespace std;
typedef long long ll;

void print_dp(const vector<vector<int>>& m)
{
	for (int i = 0; i < 20; i++)
	{
		for (int j = 0; j < 10; j++)
		{
			cout << setfill('0') << setw(2) << m[i][j] << " ";
		}
		cout << "\n";
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);

	int capacity, n; cin >> capacity >> n;
	vector<vector<pair<int,int>>> temp(2001,vector<pair<int,int>>());
	for (int i = 0; i < n; i++)
	{
		int value, weight, cnt; cin >> value >> weight >> cnt;
		temp[weight].push_back({ value,cnt });
	}
	for (int w = 0; w < temp.size(); w++)
		sort(temp[w].begin(), temp[w].end(),greater<pair<int,int>>());
	vector<vector<int>> equal_weight_items(2001, vector<int>());
	for (int w = 0; w < temp.size(); w++)
	{
		int added_cnt = 0;
		for (auto item: temp[w])
		{
			for (int i = 0; i < item.second && added_cnt < 2000; i++, added_cnt++)
				equal_weight_items[w].push_back(item.first);
			if (added_cnt == 2000)
				break;
		}
	}
	vector<vector<int>> dp(2001, vector<int>(2001, 0));
	for (int cap = 1; cap <= capacity; cap++)
	{
		for (int w = 1; w < equal_weight_items.size(); w++)
		{
			int remaining_capacity = cap;
			int added_val = 0;
			dp[cap][w] = dp[cap][w-1];
			for (int val: equal_weight_items[w])
			{
				remaining_capacity -= w;
				added_val += val;
				if (remaining_capacity < 0)
					break;
				dp[cap][w] = max(dp[cap][w], dp[remaining_capacity][w - 1] + added_val);
			}
		}
	}
	cout << *max_element(dp[capacity].begin(), dp[capacity].end());

	return 0;
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:32:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |  for (int w = 0; w < temp.size(); w++)
      |                  ~~^~~~~~~~~~~~~
knapsack.cpp:35:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |  for (int w = 0; w < temp.size(); w++)
      |                  ~~^~~~~~~~~~~~~
knapsack.cpp:49:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |   for (int w = 1; w < equal_weight_items.size(); w++)
      |                   ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 13 ms 16224 KB Output is correct
2 Correct 14 ms 16072 KB Output is correct
3 Correct 14 ms 16084 KB Output is correct
4 Correct 14 ms 16084 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 16084 KB Output is correct
2 Correct 17 ms 16064 KB Output is correct
3 Correct 19 ms 16212 KB Output is correct
4 Correct 18 ms 16212 KB Output is correct
5 Correct 18 ms 16076 KB Output is correct
6 Correct 21 ms 16064 KB Output is correct
7 Correct 20 ms 16084 KB Output is correct
8 Correct 20 ms 16068 KB Output is correct
9 Correct 22 ms 16068 KB Output is correct
10 Correct 20 ms 16084 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 16084 KB Output is correct
2 Correct 17 ms 16064 KB Output is correct
3 Correct 19 ms 16212 KB Output is correct
4 Correct 18 ms 16212 KB Output is correct
5 Correct 18 ms 16076 KB Output is correct
6 Correct 21 ms 16064 KB Output is correct
7 Correct 20 ms 16084 KB Output is correct
8 Correct 20 ms 16068 KB Output is correct
9 Correct 22 ms 16068 KB Output is correct
10 Correct 20 ms 16084 KB Output is correct
11 Correct 8 ms 16084 KB Output is correct
12 Correct 20 ms 16128 KB Output is correct
13 Correct 18 ms 16168 KB Output is correct
14 Correct 19 ms 16096 KB Output is correct
15 Correct 18 ms 16084 KB Output is correct
16 Correct 26 ms 16116 KB Output is correct
17 Correct 22 ms 16172 KB Output is correct
18 Correct 21 ms 16084 KB Output is correct
19 Correct 21 ms 16084 KB Output is correct
20 Correct 21 ms 16116 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 13 ms 16224 KB Output is correct
2 Correct 14 ms 16072 KB Output is correct
3 Correct 14 ms 16084 KB Output is correct
4 Correct 14 ms 16084 KB Output is correct
5 Correct 8 ms 16084 KB Output is correct
6 Correct 17 ms 16064 KB Output is correct
7 Correct 19 ms 16212 KB Output is correct
8 Correct 18 ms 16212 KB Output is correct
9 Correct 18 ms 16076 KB Output is correct
10 Correct 21 ms 16064 KB Output is correct
11 Correct 20 ms 16084 KB Output is correct
12 Correct 20 ms 16068 KB Output is correct
13 Correct 22 ms 16068 KB Output is correct
14 Correct 20 ms 16084 KB Output is correct
15 Correct 8 ms 16084 KB Output is correct
16 Correct 20 ms 16128 KB Output is correct
17 Correct 18 ms 16168 KB Output is correct
18 Correct 19 ms 16096 KB Output is correct
19 Correct 18 ms 16084 KB Output is correct
20 Correct 26 ms 16116 KB Output is correct
21 Correct 22 ms 16172 KB Output is correct
22 Correct 21 ms 16084 KB Output is correct
23 Correct 21 ms 16084 KB Output is correct
24 Correct 21 ms 16116 KB Output is correct
25 Correct 10 ms 16084 KB Output is correct
26 Correct 29 ms 16084 KB Output is correct
27 Correct 18 ms 16064 KB Output is correct
28 Correct 18 ms 16084 KB Output is correct
29 Correct 18 ms 16196 KB Output is correct
30 Correct 25 ms 16852 KB Output is correct
31 Correct 20 ms 16084 KB Output is correct
32 Correct 20 ms 16172 KB Output is correct
33 Correct 21 ms 16084 KB Output is correct
34 Correct 25 ms 16124 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 13 ms 16224 KB Output is correct
2 Correct 14 ms 16072 KB Output is correct
3 Correct 14 ms 16084 KB Output is correct
4 Correct 14 ms 16084 KB Output is correct
5 Correct 8 ms 16084 KB Output is correct
6 Correct 17 ms 16064 KB Output is correct
7 Correct 19 ms 16212 KB Output is correct
8 Correct 18 ms 16212 KB Output is correct
9 Correct 18 ms 16076 KB Output is correct
10 Correct 21 ms 16064 KB Output is correct
11 Correct 20 ms 16084 KB Output is correct
12 Correct 20 ms 16068 KB Output is correct
13 Correct 22 ms 16068 KB Output is correct
14 Correct 20 ms 16084 KB Output is correct
15 Correct 8 ms 16084 KB Output is correct
16 Correct 20 ms 16128 KB Output is correct
17 Correct 18 ms 16168 KB Output is correct
18 Correct 19 ms 16096 KB Output is correct
19 Correct 18 ms 16084 KB Output is correct
20 Correct 26 ms 16116 KB Output is correct
21 Correct 22 ms 16172 KB Output is correct
22 Correct 21 ms 16084 KB Output is correct
23 Correct 21 ms 16084 KB Output is correct
24 Correct 21 ms 16116 KB Output is correct
25 Correct 10 ms 16084 KB Output is correct
26 Correct 29 ms 16084 KB Output is correct
27 Correct 18 ms 16064 KB Output is correct
28 Correct 18 ms 16084 KB Output is correct
29 Correct 18 ms 16196 KB Output is correct
30 Correct 25 ms 16852 KB Output is correct
31 Correct 20 ms 16084 KB Output is correct
32 Correct 20 ms 16172 KB Output is correct
33 Correct 21 ms 16084 KB Output is correct
34 Correct 25 ms 16124 KB Output is correct
35 Correct 40 ms 17964 KB Output is correct
36 Correct 60 ms 18248 KB Output is correct
37 Correct 57 ms 18024 KB Output is correct
38 Correct 46 ms 18364 KB Output is correct
39 Correct 54 ms 19176 KB Output is correct
40 Correct 209 ms 35396 KB Output is correct
41 Correct 103 ms 19012 KB Output is correct
42 Correct 117 ms 19504 KB Output is correct
43 Correct 141 ms 19720 KB Output is correct
44 Correct 130 ms 20148 KB Output is correct
45 Correct 59 ms 20980 KB Output is correct
46 Correct 49 ms 18836 KB Output is correct
47 Correct 73 ms 22648 KB Output is correct
48 Correct 117 ms 27328 KB Output is correct
49 Correct 48 ms 19308 KB Output is correct
50 Correct 90 ms 19276 KB Output is correct