oj.uz

Submission #839043

# Submission time Handle Problem Language Result Execution time Memory
839043 2023-08-28T14:28:03 Z snasibov05 Knapsack (NOI18_knapsack) C++17
100 / 100
 69 ms 37632 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define double long double
#define ull unsigned long long
#define pii pair<int,int>
#define tiii tuple<int,int,int>
#define pll pair<long long, long long>
#define pdd pair<double, double>
#define s second
#define f first
#define pb push_back
#define oo 1000000000000000000ll
#define all(a) (a).begin(), a.end()
#define rall(a) (a).rbegin(), a.rend()
#define mp make_pair

void solve() {

	int s, n; cin >> s >> n;
	vector<int> v(n), w(n), k(n);
	for (int i = 0; i < n; ++i) cin >> v[i] >> w[i] >> k[i];
	
	vector< vector< pair<int, int> > > by_weight(s+1);
	for (int i = 0; i < n; ++i){
		by_weight[w[i]].pb(mp(v[i], k[i]));
	}
	
	for (int i = 1; i <= s; ++i){
		sort(rall(by_weight[i]));
	}
	
	vector< vector<int> > dp(s+1, vector<int>(s+1, -oo)); dp[0][0] = 0;
	for (int i = 1; i <= s; ++i){
		
		for (int j = 0; j <= s; ++j){
			dp[i][j] = dp[i-1][j];
			
			int cur_idx = 0;
			int cur_cnt = 0;
			int smv = 0;
			int smw = 0;
			
			while (cur_idx < by_weight[i].size() && smw + i <= j){
				smw += i;
				smv += by_weight[i][cur_idx].f;
				dp[i][j] = max(dp[i][j], dp[i-1][j - smw] + smv);
				
				cur_cnt++;
				if (cur_cnt == by_weight[i][cur_idx].s){
					cur_cnt = 0;
					cur_idx++;
				}
			}
			
			//cerr << i << " " << j << " " << dp[i][j] << "\n";
		}
		//cerr << "\n";
	}
	
	int ans = 0;
	for (int i = 1; i <= s; ++i) ans = max(ans, dp[s][i]);
	
	cout << ans << "\n";

}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int tst; tst = 1;
    //cin >> tst;
    while (tst--){
        solve();
    }

    return 0;

}

Compilation message

knapsack.cpp: In function 'void solve()':
knapsack.cpp:46:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |    while (cur_idx < by_weight[i].size() && smw + i <= j){
      |           ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 15 ms 31700 KB Output is correct
3 Correct 16 ms 31700 KB Output is correct
4 Correct 13 ms 31620 KB Output is correct
5 Correct 14 ms 31664 KB Output is correct
6 Correct 15 ms 31700 KB Output is correct
7 Correct 16 ms 31748 KB Output is correct
8 Correct 17 ms 31700 KB Output is correct
9 Correct 16 ms 31700 KB Output is correct
10 Correct 16 ms 31700 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 15 ms 31700 KB Output is correct
3 Correct 16 ms 31700 KB Output is correct
4 Correct 13 ms 31620 KB Output is correct
5 Correct 14 ms 31664 KB Output is correct
6 Correct 15 ms 31700 KB Output is correct
7 Correct 16 ms 31748 KB Output is correct
8 Correct 17 ms 31700 KB Output is correct
9 Correct 16 ms 31700 KB Output is correct
10 Correct 16 ms 31700 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 23 ms 31700 KB Output is correct
13 Correct 16 ms 31700 KB Output is correct
14 Correct 16 ms 31700 KB Output is correct
15 Correct 16 ms 31572 KB Output is correct
16 Correct 16 ms 31700 KB Output is correct
17 Correct 17 ms 31700 KB Output is correct
18 Correct 16 ms 31700 KB Output is correct
19 Correct 16 ms 31700 KB Output is correct
20 Correct 16 ms 31700 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12244 KB Output is correct
2 Correct 6 ms 12244 KB Output is correct
3 Correct 6 ms 12244 KB Output is correct
4 Correct 6 ms 12244 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 15 ms 31700 KB Output is correct
7 Correct 16 ms 31700 KB Output is correct
8 Correct 13 ms 31620 KB Output is correct
9 Correct 14 ms 31664 KB Output is correct
10 Correct 15 ms 31700 KB Output is correct
11 Correct 16 ms 31748 KB Output is correct
12 Correct 17 ms 31700 KB Output is correct
13 Correct 16 ms 31700 KB Output is correct
14 Correct 16 ms 31700 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 23 ms 31700 KB Output is correct
17 Correct 16 ms 31700 KB Output is correct
18 Correct 16 ms 31700 KB Output is correct
19 Correct 16 ms 31572 KB Output is correct
20 Correct 16 ms 31700 KB Output is correct
21 Correct 17 ms 31700 KB Output is correct
22 Correct 16 ms 31700 KB Output is correct
23 Correct 16 ms 31700 KB Output is correct
24 Correct 16 ms 31700 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 22 ms 31700 KB Output is correct
27 Correct 18 ms 31700 KB Output is correct
28 Correct 16 ms 31696 KB Output is correct
29 Correct 16 ms 31672 KB Output is correct
30 Correct 16 ms 31700 KB Output is correct
31 Correct 17 ms 31744 KB Output is correct
32 Correct 16 ms 31700 KB Output is correct
33 Correct 22 ms 31572 KB Output is correct
34 Correct 15 ms 31700 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12244 KB Output is correct
2 Correct 6 ms 12244 KB Output is correct
3 Correct 6 ms 12244 KB Output is correct
4 Correct 6 ms 12244 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 15 ms 31700 KB Output is correct
7 Correct 16 ms 31700 KB Output is correct
8 Correct 13 ms 31620 KB Output is correct
9 Correct 14 ms 31664 KB Output is correct
10 Correct 15 ms 31700 KB Output is correct
11 Correct 16 ms 31748 KB Output is correct
12 Correct 17 ms 31700 KB Output is correct
13 Correct 16 ms 31700 KB Output is correct
14 Correct 16 ms 31700 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 23 ms 31700 KB Output is correct
17 Correct 16 ms 31700 KB Output is correct
18 Correct 16 ms 31700 KB Output is correct
19 Correct 16 ms 31572 KB Output is correct
20 Correct 16 ms 31700 KB Output is correct
21 Correct 17 ms 31700 KB Output is correct
22 Correct 16 ms 31700 KB Output is correct
23 Correct 16 ms 31700 KB Output is correct
24 Correct 16 ms 31700 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 22 ms 31700 KB Output is correct
27 Correct 18 ms 31700 KB Output is correct
28 Correct 16 ms 31696 KB Output is correct
29 Correct 16 ms 31672 KB Output is correct
30 Correct 16 ms 31700 KB Output is correct
31 Correct 17 ms 31744 KB Output is correct
32 Correct 16 ms 31700 KB Output is correct
33 Correct 22 ms 31572 KB Output is correct
34 Correct 15 ms 31700 KB Output is correct
35 Correct 24 ms 5728 KB Output is correct
36 Correct 45 ms 36588 KB Output is correct
37 Correct 51 ms 36668 KB Output is correct
38 Correct 38 ms 36660 KB Output is correct
39 Correct 44 ms 36540 KB Output is correct
40 Correct 69 ms 37492 KB Output is correct
41 Correct 48 ms 37448 KB Output is correct
42 Correct 49 ms 37452 KB Output is correct
43 Correct 57 ms 37452 KB Output is correct
44 Correct 61 ms 37364 KB Output is correct
45 Correct 43 ms 37448 KB Output is correct
46 Correct 46 ms 36712 KB Output is correct
47 Correct 48 ms 37632 KB Output is correct
48 Correct 51 ms 37328 KB Output is correct
49 Correct 42 ms 37260 KB Output is correct
50 Correct 54 ms 36824 KB Output is correct