#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll INF = -1e18;
const int MOD = 1e9 + 7;
int n, m;
ll dp[100002];
struct lol{
int c, f, x;
bool operator < (const lol &other) {
if (f == other.f)
return c > other.c;
return f > other.f;
}
} v[4002];
int main ()
{
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> v[i].c >> v[i].f >> v[i].x;
v[i].x = -v[i].x;
}
cin >> m;
for (int i = 1; i <= m; i++) {
cin >> v[i + n].c >> v[i + n].f >> v[i + n].x;
v[i + n].c = -v[i + n].c;
}
sort(v + 1, v + n + m + 1);
fill(dp, dp + 50 * n + 1, INF);
dp[0] = 0;
for (int i = 1; i <= n + m; i++) {
if (v[i].c > 0) {
for (int j = 50 * n - v[i].c; j >= 0; j--)
dp[j + v[i].c] = max(dp[j] + v[i].x, dp[j + v[i].c]);
}
else {
for (int j = -v[i].c; j <= 50 * n; j++) {
dp[j + v[i].c] = max(dp[j + v[i].c], dp[j] + v[i].x);
}
}
}
ll ans = 0;
for (int i = 0; i <= 50 * n; i++)
ans = max(ans, dp[i]);
cout << ans;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
2 ms |
344 KB |
Output is correct |
6 |
Correct |
4 ms |
340 KB |
Output is correct |
7 |
Correct |
4 ms |
340 KB |
Output is correct |
8 |
Correct |
3 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
36 ms |
680 KB |
Output is correct |
6 |
Correct |
33 ms |
672 KB |
Output is correct |
7 |
Correct |
172 ms |
1112 KB |
Output is correct |
8 |
Correct |
163 ms |
1108 KB |
Output is correct |
9 |
Correct |
156 ms |
1108 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
4 ms |
340 KB |
Output is correct |
6 |
Correct |
4 ms |
340 KB |
Output is correct |
7 |
Correct |
5 ms |
340 KB |
Output is correct |
8 |
Correct |
6 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
91 ms |
924 KB |
Output is correct |
4 |
Correct |
2 ms |
340 KB |
Output is correct |
5 |
Correct |
305 ms |
1184 KB |
Output is correct |
6 |
Correct |
323 ms |
1176 KB |
Output is correct |
7 |
Correct |
344 ms |
1184 KB |
Output is correct |
8 |
Correct |
308 ms |
1228 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
20 ms |
564 KB |
Output is correct |
4 |
Correct |
65 ms |
596 KB |
Output is correct |
5 |
Correct |
315 ms |
1120 KB |
Output is correct |
6 |
Correct |
339 ms |
1108 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
2 ms |
344 KB |
Output is correct |
6 |
Correct |
4 ms |
340 KB |
Output is correct |
7 |
Correct |
4 ms |
340 KB |
Output is correct |
8 |
Correct |
3 ms |
340 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
364 KB |
Output is correct |
13 |
Correct |
36 ms |
680 KB |
Output is correct |
14 |
Correct |
33 ms |
672 KB |
Output is correct |
15 |
Correct |
172 ms |
1112 KB |
Output is correct |
16 |
Correct |
163 ms |
1108 KB |
Output is correct |
17 |
Correct |
156 ms |
1108 KB |
Output is correct |
18 |
Correct |
0 ms |
212 KB |
Output is correct |
19 |
Correct |
1 ms |
212 KB |
Output is correct |
20 |
Correct |
1 ms |
340 KB |
Output is correct |
21 |
Correct |
1 ms |
340 KB |
Output is correct |
22 |
Correct |
4 ms |
340 KB |
Output is correct |
23 |
Correct |
4 ms |
340 KB |
Output is correct |
24 |
Correct |
5 ms |
340 KB |
Output is correct |
25 |
Correct |
6 ms |
340 KB |
Output is correct |
26 |
Correct |
0 ms |
212 KB |
Output is correct |
27 |
Correct |
0 ms |
212 KB |
Output is correct |
28 |
Correct |
91 ms |
924 KB |
Output is correct |
29 |
Correct |
2 ms |
340 KB |
Output is correct |
30 |
Correct |
305 ms |
1184 KB |
Output is correct |
31 |
Correct |
323 ms |
1176 KB |
Output is correct |
32 |
Correct |
344 ms |
1184 KB |
Output is correct |
33 |
Correct |
308 ms |
1228 KB |
Output is correct |
34 |
Correct |
0 ms |
212 KB |
Output is correct |
35 |
Correct |
1 ms |
340 KB |
Output is correct |
36 |
Correct |
20 ms |
564 KB |
Output is correct |
37 |
Correct |
65 ms |
596 KB |
Output is correct |
38 |
Correct |
315 ms |
1120 KB |
Output is correct |
39 |
Correct |
339 ms |
1108 KB |
Output is correct |
40 |
Correct |
21 ms |
468 KB |
Output is correct |
41 |
Correct |
59 ms |
596 KB |
Output is correct |
42 |
Correct |
219 ms |
980 KB |
Output is correct |
43 |
Correct |
322 ms |
1180 KB |
Output is correct |
44 |
Correct |
326 ms |
1192 KB |
Output is correct |
45 |
Correct |
335 ms |
1228 KB |
Output is correct |
46 |
Correct |
80 ms |
744 KB |
Output is correct |
47 |
Correct |
194 ms |
980 KB |
Output is correct |
48 |
Correct |
193 ms |
980 KB |
Output is correct |