Submission #869895

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
869895	2023-11-06T06:28:35 Z	Karnis_052	Knapsack (NOI18_knapsack)	C++17	100 / 100	45 ms	4948 KB

knapsack

// Bismillahir Rahmanir Rahim

/// It is a oj.uz oj's problem
// problem link https://oj.uz/problem/view/NOI18_knapsack
#include<bits/stdc++.h>
using namespace std;
typedef long long int  ll;
typedef pair<int, int>PI;
typedef pair<ll, ll > PL;
typedef vector<int>VI;
typedef vector<ll>VL;
#define FF first
#define SS second
#define sz size()
const int mod = 1e9 + 7;
const int INF = 1e9;
const int N = 2e3 + 5;
int main()
{
	ios::sync_with_stdio(false);   cin.tie(0); cout.tie(0);
	ll bag, n, value, weight, k;
	cin >> bag >> n;
	vector<PL>items[N];
	for (int i = 0; i < n; i++)
	{
		cin >> value >> weight >> k;
		items[weight].push_back({value, k});
	}
	vector<ll>dp(N);
	dp[0] = 0;
	for (ll i = 1; i < N; i++)
	{
		if (items[i].size() == 0)continue;
		sort(items[i].rbegin(), items[i].rend());


		ll coun = 0, it = 0;
		while (coun * i <= bag and it < items[i].size())
		{
			int picked = 0;
			while (coun * i <= bag and picked < items[i][it].SS)
			{
				for (ll j = bag; j >= i; j--)
					dp[j] = max(dp[j], dp[j - i] + items[i][it].FF);
				coun++;
				picked++;
			}
			it++;
		}

	}
	ll ans = 0;
	for (int i = 0; i < N; i++)
		ans = max(ans, dp[i]);
	cout << ans << '\n';


	cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
	return 0;
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:38:33: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |   while (coun * i <= bag and it < items[i].size())
      |                              ~~~^~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	496 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct

Subtask #2
17.0 / 17.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
24.0 / 24.0

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

Subtask #5
27.0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	496 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	388 KB	Output is correct
7	Correct	1 ms	500 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	496 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	2 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	3 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	1 ms	344 KB	Output is correct
33	Correct	1 ms	344 KB	Output is correct
34	Correct	1 ms	496 KB	Output is correct
35	Correct	22 ms	3544 KB	Output is correct
36	Correct	26 ms	3540 KB	Output is correct
37	Correct	25 ms	3540 KB	Output is correct
38	Correct	25 ms	3772 KB	Output is correct
39	Correct	27 ms	4364 KB	Output is correct
40	Correct	45 ms	4692 KB	Output is correct
41	Correct	32 ms	4064 KB	Output is correct
42	Correct	32 ms	3932 KB	Output is correct
43	Correct	41 ms	4140 KB	Output is correct
44	Correct	40 ms	3928 KB	Output is correct
45	Correct	25 ms	4700 KB	Output is correct
46	Correct	27 ms	4152 KB	Output is correct
47	Correct	29 ms	4948 KB	Output is correct
48	Correct	33 ms	4700 KB	Output is correct
49	Correct	24 ms	4628 KB	Output is correct
50	Correct	37 ms	4348 KB	Output is correct

Submission #869895

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 17.0 / 17.0

Subtask #3 20.0 / 20.0

Subtask #4 24.0 / 24.0

Subtask #5 27.0 / 27.0

Subtask #1
12.0 / 12.0

Subtask #2
17.0 / 17.0

Subtask #3
20.0 / 20.0

Subtask #4
24.0 / 24.0

Subtask #5
27.0 / 27.0