oj.uz

Submission #649427

# Submission time Handle Problem Language Result Execution time Memory
649427 2022-10-10T07:59:34 Z narcissus Knapsack (NOI18_knapsack) C++17
100 / 100
 164 ms 35028 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>

using namespace std;

int main()
{
	int s, n;
	cin >> s >> n;

	int v, w, k;
	map<int, vector<pair<int, int>>> items;
	for (int i = 0; i < n; i++) {
		cin >> v >> w >> k;
		if (w <= s) {
			items[w].push_back({v, k});
		}
	}

	int itemCnt = items.size();
	long long dp[itemCnt + 1][s + 1];
	for (int i = 0; i <= itemCnt; i++) {
		for (int j = 0; j <= s; j++) {
			dp[i][j] = (i == 0 || j == 0) ? 0 : -1;
		}
	}
	
	long long maxVal = 0, i = 1;
	for (auto item : items) {
		w = item.first;
		sort(item.second.begin(), item.second.end(), greater<pair<int, int>>());

		for (int j = 1; j <= s; j++) {
			int amnt = 0;	// cur item amnt
			int icnt = 0;	// different item count
			int tot = 0;	// total item count
			long long profit = 0;

			dp[i][j] = dp[i - 1][j];
			while ((tot + 1) * w <= j && icnt < item.second.size()) {
				tot++;
				profit += item.second[icnt].first;
				if (dp[i - 1][j - tot * w] != -1) {
					dp[i][j] = max(dp[i][j], dp[i - 1][j - tot * w] + profit);
					maxVal = max(maxVal, dp[i][j]);
				}
				amnt++;
				if (amnt == item.second[icnt].second) {
					amnt = 0;
					icnt++;
				}
			}
		}

		i++;
	}

	cout << maxVal << endl;

	return 0;
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:42:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |    while ((tot + 1) * w <= j && icnt < item.second.size()) {
      |                                 ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 1748 KB Output is correct
7 Correct 3 ms 1748 KB Output is correct
8 Correct 2 ms 1748 KB Output is correct
9 Correct 2 ms 1748 KB Output is correct
10 Correct 2 ms 1704 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 1748 KB Output is correct
7 Correct 3 ms 1748 KB Output is correct
8 Correct 2 ms 1748 KB Output is correct
9 Correct 2 ms 1748 KB Output is correct
10 Correct 2 ms 1704 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 212 KB Output is correct
13 Correct 2 ms 212 KB Output is correct
14 Correct 1 ms 280 KB Output is correct
15 Correct 1 ms 456 KB Output is correct
16 Correct 3 ms 1832 KB Output is correct
17 Correct 2 ms 1748 KB Output is correct
18 Correct 2 ms 1748 KB Output is correct
19 Correct 3 ms 1748 KB Output is correct
20 Correct 2 ms 1748 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 1748 KB Output is correct
11 Correct 3 ms 1748 KB Output is correct
12 Correct 2 ms 1748 KB Output is correct
13 Correct 2 ms 1748 KB Output is correct
14 Correct 2 ms 1704 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 6 ms 212 KB Output is correct
17 Correct 2 ms 212 KB Output is correct
18 Correct 1 ms 280 KB Output is correct
19 Correct 1 ms 456 KB Output is correct
20 Correct 3 ms 1832 KB Output is correct
21 Correct 2 ms 1748 KB Output is correct
22 Correct 2 ms 1748 KB Output is correct
23 Correct 3 ms 1748 KB Output is correct
24 Correct 2 ms 1748 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 8 ms 296 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 3 ms 1748 KB Output is correct
31 Correct 2 ms 1832 KB Output is correct
32 Correct 2 ms 1748 KB Output is correct
33 Correct 3 ms 1748 KB Output is correct
34 Correct 3 ms 1712 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 1748 KB Output is correct
11 Correct 3 ms 1748 KB Output is correct
12 Correct 2 ms 1748 KB Output is correct
13 Correct 2 ms 1748 KB Output is correct
14 Correct 2 ms 1704 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 6 ms 212 KB Output is correct
17 Correct 2 ms 212 KB Output is correct
18 Correct 1 ms 280 KB Output is correct
19 Correct 1 ms 456 KB Output is correct
20 Correct 3 ms 1832 KB Output is correct
21 Correct 2 ms 1748 KB Output is correct
22 Correct 2 ms 1748 KB Output is correct
23 Correct 3 ms 1748 KB Output is correct
24 Correct 2 ms 1748 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 8 ms 296 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 3 ms 1748 KB Output is correct
31 Correct 2 ms 1832 KB Output is correct
32 Correct 2 ms 1748 KB Output is correct
33 Correct 3 ms 1748 KB Output is correct
34 Correct 3 ms 1712 KB Output is correct
35 Correct 65 ms 3004 KB Output is correct
36 Correct 80 ms 3260 KB Output is correct
37 Correct 70 ms 3084 KB Output is correct
38 Correct 77 ms 2740 KB Output is correct
39 Correct 97 ms 3556 KB Output is correct
40 Correct 164 ms 35028 KB Output is correct
41 Correct 127 ms 34292 KB Output is correct
42 Correct 128 ms 34260 KB Output is correct
43 Correct 146 ms 34352 KB Output is correct
44 Correct 141 ms 34124 KB Output is correct
45 Correct 104 ms 6716 KB Output is correct
46 Correct 98 ms 3960 KB Output is correct
47 Correct 108 ms 9904 KB Output is correct
48 Correct 131 ms 19256 KB Output is correct
49 Correct 88 ms 3964 KB Output is correct
50 Correct 130 ms 4048 KB Output is correct