oj.uz

Submission #416584

# Submission time Handle Problem Language Result Execution time Memory
416584 2021-06-02T16:23:37 Z penguinhacker Knapsack (NOI18_knapsack) C++14
100 / 100
 69 ms 3648 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

const int mxS=2000;
int n, s, dp[mxS+1];
vector<ar<int, 2>> v[mxS+1];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> s >> n;
	for (int i=0; i<n; ++i) {
		int a, b, c;
		cin >> a >> b >> c;
		v[b].push_back({a, c});
	}
	for (int i=1; i<=s; ++i) {
		if (v[i].empty())
			continue;
		sort(v[i].rbegin(), v[i].rend());
		int x=i;
		for (ar<int, 2> a : v[i]) {
			if (x>s)
				break;
			for (int j=0; j<a[1]&&x<=s; ++j, x+=i)
				for (int k=s; k>=i; --k)
					dp[k]=max(dp[k], dp[k-i]+a[0]);
		}
	}
	cout << dp[s];
	return 0;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 368 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct

Subtask #3
20.0 / 20.0

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

Subtask #4
24.0 / 24.0

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

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 368 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 368 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 364 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 360 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 4 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 368 KB Output is correct
30 Correct 2 ms 364 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 37 ms 2380 KB Output is correct
36 Correct 43 ms 2532 KB Output is correct
37 Correct 40 ms 2300 KB Output is correct
38 Correct 39 ms 2592 KB Output is correct
39 Correct 50 ms 3376 KB Output is correct
40 Correct 69 ms 3524 KB Output is correct
41 Correct 50 ms 2740 KB Output is correct
42 Correct 52 ms 2784 KB Output is correct
43 Correct 63 ms 2764 KB Output is correct
44 Correct 63 ms 2756 KB Output is correct
45 Correct 55 ms 3648 KB Output is correct
46 Correct 47 ms 3212 KB Output is correct
47 Correct 49 ms 3616 KB Output is correct
48 Correct 69 ms 3576 KB Output is correct
49 Correct 42 ms 3396 KB Output is correct
50 Correct 58 ms 3300 KB Output is correct