// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define pb push_back
using ll = long long;
template<class T> using V = vector<T>;
using vi = V<int>;
using vl = V<ll>;
const ll INF = ll(1e15) + 10;
int main() {
cin.tie(0)->sync_with_stdio(0);
int N; cin >> N;
V<array<int, 4>> A;
for(int i = 0; i < N; i++) {
int c, f, v; cin >> c >> f >> v;
A.pb({f, 1, c, v});
}
int M; cin >> M;
for(int i = 0; i < M; i++) {
int c, f, v; cin >> c >> f >> v;
A.pb({f, -1, c, v});
}
sort(begin(A), end(A));
const int nax = N * 50 + 5;
vl dp(nax, -INF); dp[0] = 0;
for(int i = 0; i < N + M; i++) {
if (A[i][1] == -1) {
int c = A[i][2], v = A[i][3];
for(int x = nax - 1; x >= 0; x--) if (dp[x] != -INF) {
int y = x + c;
if (y < nax) dp[y] = max(dp[x] + v, dp[y]);
}
} else {
int c = A[i][2], v = A[i][3];
for(int x = 0; x < nax; x++) if (dp[x] != -INF) {
int y = max(x - int(c), 0);
dp[y] = max(dp[x] - v, dp[y]);
}
}
}
cout << dp[0] << nl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 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 |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
3 ms |
340 KB |
Output is correct |
6 |
Correct |
3 ms |
380 KB |
Output is correct |
7 |
Correct |
4 ms |
384 KB |
Output is correct |
8 |
Correct |
3 ms |
364 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
0 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 |
47 ms |
724 KB |
Output is correct |
6 |
Correct |
39 ms |
712 KB |
Output is correct |
7 |
Correct |
195 ms |
1096 KB |
Output is correct |
8 |
Correct |
240 ms |
1108 KB |
Output is correct |
9 |
Correct |
189 ms |
1108 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
320 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
328 KB |
Output is correct |
5 |
Correct |
5 ms |
440 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 |
440 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
112 ms |
980 KB |
Output is correct |
4 |
Correct |
2 ms |
340 KB |
Output is correct |
5 |
Correct |
382 ms |
1236 KB |
Output is correct |
6 |
Correct |
413 ms |
1236 KB |
Output is correct |
7 |
Correct |
444 ms |
1236 KB |
Output is correct |
8 |
Correct |
390 ms |
1180 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
21 ms |
468 KB |
Output is correct |
4 |
Correct |
73 ms |
716 KB |
Output is correct |
5 |
Correct |
377 ms |
1236 KB |
Output is correct |
6 |
Correct |
448 ms |
1236 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 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 |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
3 ms |
340 KB |
Output is correct |
6 |
Correct |
3 ms |
380 KB |
Output is correct |
7 |
Correct |
4 ms |
384 KB |
Output is correct |
8 |
Correct |
3 ms |
364 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
340 KB |
Output is correct |
13 |
Correct |
47 ms |
724 KB |
Output is correct |
14 |
Correct |
39 ms |
712 KB |
Output is correct |
15 |
Correct |
195 ms |
1096 KB |
Output is correct |
16 |
Correct |
240 ms |
1108 KB |
Output is correct |
17 |
Correct |
189 ms |
1108 KB |
Output is correct |
18 |
Correct |
0 ms |
212 KB |
Output is correct |
19 |
Correct |
0 ms |
320 KB |
Output is correct |
20 |
Correct |
1 ms |
340 KB |
Output is correct |
21 |
Correct |
1 ms |
328 KB |
Output is correct |
22 |
Correct |
5 ms |
440 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 |
440 KB |
Output is correct |
26 |
Correct |
0 ms |
212 KB |
Output is correct |
27 |
Correct |
1 ms |
212 KB |
Output is correct |
28 |
Correct |
112 ms |
980 KB |
Output is correct |
29 |
Correct |
2 ms |
340 KB |
Output is correct |
30 |
Correct |
382 ms |
1236 KB |
Output is correct |
31 |
Correct |
413 ms |
1236 KB |
Output is correct |
32 |
Correct |
444 ms |
1236 KB |
Output is correct |
33 |
Correct |
390 ms |
1180 KB |
Output is correct |
34 |
Correct |
1 ms |
212 KB |
Output is correct |
35 |
Correct |
1 ms |
340 KB |
Output is correct |
36 |
Correct |
21 ms |
468 KB |
Output is correct |
37 |
Correct |
73 ms |
716 KB |
Output is correct |
38 |
Correct |
377 ms |
1236 KB |
Output is correct |
39 |
Correct |
448 ms |
1236 KB |
Output is correct |
40 |
Correct |
25 ms |
468 KB |
Output is correct |
41 |
Correct |
76 ms |
584 KB |
Output is correct |
42 |
Correct |
195 ms |
980 KB |
Output is correct |
43 |
Correct |
368 ms |
1236 KB |
Output is correct |
44 |
Correct |
370 ms |
1236 KB |
Output is correct |
45 |
Correct |
342 ms |
1236 KB |
Output is correct |
46 |
Correct |
78 ms |
768 KB |
Output is correct |
47 |
Correct |
176 ms |
980 KB |
Output is correct |
48 |
Correct |
174 ms |
1036 KB |
Output is correct |