Submission #891685

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
891685	2023-12-23T16:03:19 Z	BBart888	Knapsack (NOI18_knapsack)	C++14	100 / 100	91 ms	3872 KB

knapsack

#include <cstdio>
#include <iostream>
#include <vector>
#include <list>
#include <string>
#include <set>
#include <map>
#include <algorithm>
#include <fstream>
#include <cmath>
#include <queue>
#include <stack>
#include <cassert>
#include <cstring>
#include <climits>
#include <functional>
#include<cstdlib>
//#include "arc.h"
//#include "dreaming.h"



using namespace std;
const int MAXN = 2e3 + 11;
using ll = long long;
const int P = 31;
const ll mod1 = 1e9 + 7;
const ll mod2 = 1000000021;
using ld = long double;


int s, n;
vector<pair<int,int>> pre[MAXN];
vector<int> vals[MAXN];
ll dp[MAXN];


int main()
{
	cin.tie(0);
	cout.tie(0);

	//freopen("248.in", "r", stdin);
	//freopen("248.out", "w", stdout);
	
	
	cin >> s >> n;


	for (int i = 0; i < n; i++)
	{
		int v, w, k;
		cin >> v >> w >> k;
		pre[w].push_back({ v,k });
	}

	for (int i = 1; i <= s; i++)
		sort(pre[i].rbegin(), pre[i].rend());

	for (int i = 1; i <= s; i++)
	{
		int mx = s / i;
		int cur = 0;
		if (pre[i].size() == 0)
			continue;
		for (int j = 0; j < mx; j++)
		{
			if (pre[i][cur].second == 0)
			{
				cur++;
			}
			if (cur == pre[i].size())
				break;
			pre[i][cur].second--;
			vals[i].push_back(pre[i][cur].first);
		}
	}

	for (int j = 1; j <= s; j++)
	{
		if (vals[j].empty())
			continue;
		for (int i = s; i >= 0; i--)
		{
			if (i == 0 || dp[i] > 0)
			{
				ll Sum = 0;
				for (int c = 0; c < vals[j].size(); c++)
				{
					if (i + (c + 1) * j > s)
						break;
					Sum += vals[j][c];
					//cout << i + (c + 1) * j << '\n';
					dp[i + (c + 1) * j] = max(dp[i + (c + 1) * j],
						dp[i] + Sum);
				}
			}
		}
	}
	ll ans = 0;

	for (int i = 1; i <= s; i++)
		ans = max(ans, dp[i]);
		//cout << dp[i] << " ";

	cout << ans << '\n';



	return 0;
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:72:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |    if (cur == pre[i].size())
      |        ~~~~^~~~~~~~~~~~~~~~
knapsack.cpp:88:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |     for (int c = 0; c < vals[j].size(); c++)
      |                     ~~^~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

#	Verdict	Memory	Grader output
1	Correct	344 KB	Output is correct
2	Correct	600 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	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	1 ms	604 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	540 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	536 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	1 ms	604 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	540 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	536 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	528 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	1 ms	532 KB	Output is correct
18	Correct	1 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	344 KB	Output is correct
2	Correct	0 ms	600 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	1 ms	604 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	540 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	536 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	528 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	1 ms	532 KB	Output is correct
22	Correct	1 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	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 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	1 ms	532 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	1 ms	540 KB	Output is correct
34	Correct	1 ms	344 KB	Output is correct

Subtask #5
27.0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	600 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	1 ms	604 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	540 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	536 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	528 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	1 ms	532 KB	Output is correct
22	Correct	1 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	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 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	1 ms	532 KB	Output is correct
32	Correct	1 ms	348 KB	Output is correct
33	Correct	1 ms	540 KB	Output is correct
34	Correct	1 ms	344 KB	Output is correct
35	Correct	49 ms	2504 KB	Output is correct
36	Correct	57 ms	2736 KB	Output is correct
37	Correct	48 ms	2516 KB	Output is correct
38	Correct	65 ms	2904 KB	Output is correct
39	Correct	78 ms	3520 KB	Output is correct
40	Correct	91 ms	3668 KB	Output is correct
41	Correct	73 ms	2992 KB	Output is correct
42	Correct	68 ms	2912 KB	Output is correct
43	Correct	71 ms	2960 KB	Output is correct
44	Correct	70 ms	2900 KB	Output is correct
45	Correct	76 ms	3816 KB	Output is correct
46	Correct	74 ms	3340 KB	Output is correct
47	Correct	81 ms	3856 KB	Output is correct
48	Correct	87 ms	3872 KB	Output is correct
49	Correct	69 ms	3580 KB	Output is correct
50	Correct	78 ms	3292 KB	Output is correct

Submission #891685

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