oj.uz

답안 #874587

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
874587 2023-11-17T10:50:09 Z iag99 Knapsack (NOI18_knapsack) C++17
100 / 100
 132 ms 37284 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;

int main()
{
	int s,n;
	cin>>s>>n;
	vector<int> w(n);
	vector<ll> v(n),k(n);
	//w_i <= 2000
	//n <= 1e5
	map<int,vector<pair<int,int> > > mp;
	for(int i=0; i<n; i++)
	{
		cin>>v[i]>>w[i]>>k[i];
		if(w[i]<=s && k[i]>0) mp[w[i]].push_back(make_pair(v[i],k[i]));
	}
	vector<vector<ll> > dp(mp.size()+1, vector<ll>(s+1, INT_MIN));
	dp[0][0]=0;
	int at=1;
	/*
	 * dp[i][w]= answer after processing first i items, weight=w
	 * dp[i][w]=max(dp[i-1][w], dp[i-1][w-w[i]]+v[i])
	 * Sort each copy of an item by value, only take the greatest S/w_i copies
	 */		
	 for(auto &[w,items] : mp)
	 {
		 sort(items.begin(), items.end(), greater<pair<int,int>>());
		 for(int i=0; i<=s; i++)
		 {
			 dp[at][i]=dp[at-1][i];
			 int copies=0;
			 int type_at=0;
			 int curr_used=0;
			 ll profit=0;
			 while((copies+1)*w <= i && type_at < items.size())
			 {
				 copies++;
				 profit+=items[type_at].first;
				 if(dp[at-1][i-copies*w]!=INT_MIN)
				 {
					 dp[at][i]=max(dp[at][i], dp[at-1][i-copies*w]+profit);
				 }
				 curr_used++;
				 if(curr_used==items[type_at].second)
				 {
					 curr_used=0;
					 type_at++;
				 }
			 }
		 }
		 at++;
	 }
	 cout << *std::max_element(dp.back().begin(), dp.back().end()) << endl;

    return 0;
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:39:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     while((copies+1)*w <= i && type_at < items.size())
      |                                ~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 436 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 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 2 ms 1884 KB Output is correct
7 Correct 2 ms 2132 KB Output is correct
8 Correct 2 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 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 2 ms 1884 KB Output is correct
7 Correct 2 ms 2132 KB Output is correct
8 Correct 2 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 1 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 2 ms 1884 KB Output is correct
17 Correct 1 ms 2136 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 2 ms 1884 KB Output is correct
20 Correct 3 ms 1884 KB Output is correct

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 436 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 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 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 1884 KB Output is correct
11 Correct 2 ms 2132 KB Output is correct
12 Correct 2 ms 1884 KB Output is correct
13 Correct 1 ms 1884 KB Output is correct
14 Correct 1 ms 1884 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 348 KB Output is correct
17 Correct 1 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 2 ms 1884 KB Output is correct
21 Correct 1 ms 2136 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Correct 2 ms 1884 KB Output is correct
24 Correct 3 ms 1884 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 3 ms 600 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 3 ms 1884 KB Output is correct
31 Correct 2 ms 1884 KB Output is correct
32 Correct 1 ms 1884 KB Output is correct
33 Correct 2 ms 1972 KB Output is correct
34 Correct 2 ms 1884 KB Output is correct

Subtask #5
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 436 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 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 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 1884 KB Output is correct
11 Correct 2 ms 2132 KB Output is correct
12 Correct 2 ms 1884 KB Output is correct
13 Correct 1 ms 1884 KB Output is correct
14 Correct 1 ms 1884 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 348 KB Output is correct
17 Correct 1 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 2 ms 1884 KB Output is correct
21 Correct 1 ms 2136 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Correct 2 ms 1884 KB Output is correct
24 Correct 3 ms 1884 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 3 ms 600 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 3 ms 1884 KB Output is correct
31 Correct 2 ms 1884 KB Output is correct
32 Correct 1 ms 1884 KB Output is correct
33 Correct 2 ms 1972 KB Output is correct
34 Correct 2 ms 1884 KB Output is correct
35 Correct 55 ms 4200 KB Output is correct
36 Correct 60 ms 4560 KB Output is correct
37 Correct 57 ms 4308 KB Output is correct
38 Correct 70 ms 4740 KB Output is correct
39 Correct 73 ms 5320 KB Output is correct
40 Correct 117 ms 37284 KB Output is correct
41 Correct 95 ms 36472 KB Output is correct
42 Correct 96 ms 36528 KB Output is correct
43 Correct 132 ms 36516 KB Output is correct
44 Correct 98 ms 36196 KB Output is correct
45 Correct 87 ms 8780 KB Output is correct
46 Correct 77 ms 5064 KB Output is correct
47 Correct 82 ms 12248 KB Output is correct
48 Correct 117 ms 21332 KB Output is correct
49 Correct 84 ms 5796 KB Output is correct
50 Correct 87 ms 6028 KB Output is correct