oj.uz

Submission #898789

# Submission time Handle Problem Language Result Execution time Memory
898789 2024-01-05T06:15:22 Z Amaarsaa Knapsack (NOI18_knapsack) C++14
100 / 100
 59 ms 5464 KB 
#include<bits/stdc++.h>

using namespace std;
using ll = int;
const int N = 1e5 + 2;
ll weight[N], CanAdd[N], price[N], Left[N];
vector < pair < ll, ll > > W[2002];
ll dp[N];
int main() {
//	freopen("moocast.in", "r", stdin);
//	freopen("moocast.out", "w", stdout);
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	ll i, ans, j, r, last, now, n, k, p;

	cin >> k >> n;
	
	
	for (i = 1; i <= n; i ++) {
		cin >> price[i] >> weight[i] >> Left[i];
		if ( weight[i] <= k && Left[i] > 0) W[weight[i]].push_back({price[i], Left[i]});
	}
	vector < pair < ll, ll > > v;
	for (i = 1; i <= k; i ++) {
		sort(W[i].begin(), W[i].end(), greater<pair < ll, ll > >());
		r = k/i;
		p = 0;
		while ( r > 0 && p < W[i].size()) {
			v.push_back({i, W[i][p].first});
			if ( W[i][p].second == 0) p ++;
			else {
				W[i][p].second --;
				if ( W[i][p].second == 0) p ++;
			}
			r --;
		}
	}
	ans = 0;
	memset(dp, -0x3f, sizeof dp);
	dp[0] = 0;
	for (i = 0; i < v.size(); i ++) {
		for (j = k; j >= v[i].first; j --) {
			dp[j] = max(dp[j], dp[j - v[i].first] + v[i].second); 
			ans = max(ans, dp[j]);
		}
	}
	cout << ans << endl;
	
		
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:28:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |   while ( r > 0 && p < W[i].size()) {
      |                    ~~^~~~~~~~~~~~~
knapsack.cpp:41:16: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |  for (i = 0; i < v.size(); i ++) {
      |              ~~^~~~~~~~~~
knapsack.cpp:14:19: warning: unused variable 'last' [-Wunused-variable]
   14 |  ll i, ans, j, r, last, now, n, k, p;
      |                   ^~~~
knapsack.cpp:14:25: warning: unused variable 'now' [-Wunused-variable]
   14 |  ll i, ans, j, r, last, now, n, k, p;
      |                         ^~~

Subtask #1
12.0 / 12.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 860 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 0 ms 860 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 1 ms 856 KB Output is correct
7 Correct 1 ms 856 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 860 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 860 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 0 ms 860 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 1 ms 856 KB Output is correct
7 Correct 1 ms 856 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 0 ms 860 KB Output is correct
12 Correct 3 ms 888 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 0 ms 860 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 1 ms 860 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 860 KB Output is correct
2 Correct 0 ms 860 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 0 ms 860 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 1 ms 860 KB Output is correct
8 Correct 0 ms 860 KB Output is correct
9 Correct 0 ms 860 KB Output is correct
10 Correct 1 ms 856 KB Output is correct
11 Correct 1 ms 856 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 0 ms 860 KB Output is correct
16 Correct 3 ms 888 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 0 ms 860 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 1 ms 860 KB Output is correct
23 Correct 1 ms 860 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 6 ms 772 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 1 ms 856 KB Output is correct
29 Correct 1 ms 860 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 1 ms 860 KB Output is correct
32 Correct 2 ms 856 KB Output is correct
33 Correct 1 ms 860 KB Output is correct
34 Correct 1 ms 860 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 860 KB Output is correct
2 Correct 0 ms 860 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 0 ms 860 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 1 ms 860 KB Output is correct
8 Correct 0 ms 860 KB Output is correct
9 Correct 0 ms 860 KB Output is correct
10 Correct 1 ms 856 KB Output is correct
11 Correct 1 ms 856 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 1 ms 860 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 0 ms 860 KB Output is correct
16 Correct 3 ms 888 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 0 ms 860 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 1 ms 860 KB Output is correct
23 Correct 1 ms 860 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 6 ms 772 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 1 ms 856 KB Output is correct
29 Correct 1 ms 860 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 1 ms 860 KB Output is correct
32 Correct 2 ms 856 KB Output is correct
33 Correct 1 ms 860 KB Output is correct
34 Correct 1 ms 860 KB Output is correct
35 Correct 22 ms 3932 KB Output is correct
36 Correct 28 ms 4172 KB Output is correct
37 Correct 27 ms 4056 KB Output is correct
38 Correct 23 ms 4220 KB Output is correct
39 Correct 27 ms 5056 KB Output is correct
40 Correct 59 ms 5324 KB Output is correct
41 Correct 39 ms 4608 KB Output is correct
42 Correct 41 ms 4684 KB Output is correct
43 Correct 55 ms 4692 KB Output is correct
44 Correct 57 ms 4808 KB Output is correct
45 Correct 27 ms 5208 KB Output is correct
46 Correct 26 ms 4804 KB Output is correct
47 Correct 36 ms 5464 KB Output is correct
48 Correct 40 ms 5204 KB Output is correct
49 Correct 24 ms 4956 KB Output is correct
50 Correct 46 ms 5008 KB Output is correct