#include <bits/stdc++.h>
#pragma GCC optimize("O2")
#pragma GCC target("avx2,fma")
#define rep(i,l,r) for (int i = l; i < r; i++)
#define repr(i,r,l) for (int i = r; i >= l; i--)
#define X first
#define Y second
#define pb push_back
#define endl '\n'
#define debug(x) cerr << #x << " : " << x << endl;
using namespace std;
typedef long long ll;
typedef pair<int,int> pll;
const long long int N = 2e3+20,mod = 1e9+7,inf = 1e18,sq = 400;
inline int mkay(int a,int b){
if (a+b >= mod) return a+b-mod;
if (a+b < 0) return a+b+mod;
return a+b;
}
inline int poww(int n,int k){
int c = 1;
while (k){
if (k&1) c = (1ll*c*n)%mod;
n = (1ll*n*n)%mod;
k >>= 1;
}
return c;
}
int n,m;
pair<int,pll> a[N],b[N];
ll dp[2][N][51][3];
int main(){
ios :: sync_with_stdio(0); cin.tie(0);
cin >> n;
rep(i,1,n+1)
cin >> a[i].Y.X >> a[i].X >> a[i].Y.Y;
cin >> m;
rep(i,1,m+1)
cin >> b[i].Y.X >> b[i].X >> b[i].Y.Y;
sort(a+1,a+n+1);
sort(b+1,b+m+1);
rep(i,1,m+1){
rep(k,1,51){
dp[0][i][k][1] = -inf;
}
}
rep(i,1,n+1){
int d1 = (i&1);
rep(j,1,m+1){
//int d2 = (j&1);
int u = a[i].Y.X,v = b[j].Y.X;
dp[d1][j][u][2] = max(dp[1-d1][j][a[i-1].Y.X][2],dp[d1][j-1][u][2]);
if (b[j].X <= a[i].X){
if (u < v){
dp[d1][j][u][2] = max(dp[d1][j][u][2],dp[1-d1][j][v-u][1]+b[j].Y.Y-a[i].Y.Y);
}
if (u == v){
dp[d1][j][u][2] = max(dp[d1][j][u][2],dp[1-d1][j-1][a[i-1].Y.X][2]+b[j].Y.Y-a[i].Y.Y);
}
if (u > v){
dp[d1][j][u][2] = max(dp[d1][j][u][2],dp[d1][j-1][u-v][0]+b[j].Y.Y-a[i].Y.Y);
}
}
dp[d1][j][v][2] = dp[d1][j][u][2];
rep(k,1,u){
dp[d1][j][k][0] = dp[d1][j-1][k][0];
if (b[j].X <= a[i].X){
if (b[j].Y.X > k){
dp[d1][j][k][0] = max(dp[d1][j][k][0],dp[1-d1][j][b[j].Y.X-k][1]+b[j].Y.Y);
}
if (b[j].Y.X == k){
dp[d1][j][k][0] = max(dp[d1][j][k][0],dp[1-d1][j-1][a[i-1].Y.X][2]+b[j].Y.Y);
}
if (k > b[j].Y.X){
dp[d1][j][k][0] = max(dp[d1][j][k][0],dp[d1][j-1][k-b[j].Y.X][0]+b[j].Y.Y);
}
}
}
rep(k,1,v){
dp[d1][j][k][1] = dp[1-d1][j][k][1];
if (b[j].X <= a[i].X){
if (a[i].Y.X > k){
dp[d1][j][k][1] = max(dp[d1][j][k][1],dp[d1][j-1][a[i].Y.X-k][0]-a[i].Y.Y);
}
if (a[i].Y.X == k){
dp[d1][j][k][1] = max(dp[d1][j][k][1],dp[1-d1][j-1][a[i-1].Y.X][2]-a[i].Y.Y);
}
if (k > a[i].Y.X){
dp[d1][j][k][1] = max(dp[d1][j][k][1],dp[1-d1][j][k-a[i].Y.X][1]-a[i].Y.Y);
}
}
}
}
}
cout << dp[(n&1)][m][a[n].Y.X][2];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
460 KB |
Output is correct |
4 |
Correct |
1 ms |
696 KB |
Output is correct |
5 |
Correct |
6 ms |
4940 KB |
Output is correct |
6 |
Correct |
4 ms |
4940 KB |
Output is correct |
7 |
Correct |
10 ms |
5068 KB |
Output is correct |
8 |
Correct |
9 ms |
5184 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
336 KB |
Output is correct |
4 |
Correct |
1 ms |
316 KB |
Output is correct |
5 |
Correct |
2 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
5 ms |
332 KB |
Output is correct |
8 |
Correct |
5 ms |
332 KB |
Output is correct |
9 |
Correct |
7 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
588 KB |
Output is correct |
4 |
Correct |
1 ms |
460 KB |
Output is correct |
5 |
Correct |
2 ms |
684 KB |
Output is correct |
6 |
Correct |
1 ms |
588 KB |
Output is correct |
7 |
Correct |
2 ms |
836 KB |
Output is correct |
8 |
Correct |
1 ms |
844 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
320 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Correct |
2 ms |
332 KB |
Output is correct |
4 |
Correct |
7 ms |
4684 KB |
Output is correct |
5 |
Correct |
549 ms |
4652 KB |
Output is correct |
6 |
Correct |
1151 ms |
5196 KB |
Output is correct |
7 |
Correct |
1026 ms |
5196 KB |
Output is correct |
8 |
Correct |
963 ms |
5068 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
460 KB |
Output is correct |
3 |
Correct |
13 ms |
844 KB |
Output is correct |
4 |
Correct |
33 ms |
3148 KB |
Output is correct |
5 |
Correct |
776 ms |
5188 KB |
Output is correct |
6 |
Correct |
1025 ms |
5164 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
1 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
460 KB |
Output is correct |
4 |
Correct |
1 ms |
696 KB |
Output is correct |
5 |
Correct |
6 ms |
4940 KB |
Output is correct |
6 |
Correct |
4 ms |
4940 KB |
Output is correct |
7 |
Correct |
10 ms |
5068 KB |
Output is correct |
8 |
Correct |
9 ms |
5184 KB |
Output is correct |
9 |
Correct |
0 ms |
332 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
1 ms |
336 KB |
Output is correct |
12 |
Correct |
1 ms |
316 KB |
Output is correct |
13 |
Correct |
2 ms |
332 KB |
Output is correct |
14 |
Correct |
1 ms |
332 KB |
Output is correct |
15 |
Correct |
5 ms |
332 KB |
Output is correct |
16 |
Correct |
5 ms |
332 KB |
Output is correct |
17 |
Correct |
7 ms |
332 KB |
Output is correct |
18 |
Correct |
1 ms |
332 KB |
Output is correct |
19 |
Correct |
1 ms |
332 KB |
Output is correct |
20 |
Correct |
1 ms |
588 KB |
Output is correct |
21 |
Correct |
1 ms |
460 KB |
Output is correct |
22 |
Correct |
2 ms |
684 KB |
Output is correct |
23 |
Correct |
1 ms |
588 KB |
Output is correct |
24 |
Correct |
2 ms |
836 KB |
Output is correct |
25 |
Correct |
1 ms |
844 KB |
Output is correct |
26 |
Correct |
0 ms |
320 KB |
Output is correct |
27 |
Correct |
0 ms |
332 KB |
Output is correct |
28 |
Correct |
2 ms |
332 KB |
Output is correct |
29 |
Correct |
7 ms |
4684 KB |
Output is correct |
30 |
Correct |
549 ms |
4652 KB |
Output is correct |
31 |
Correct |
1151 ms |
5196 KB |
Output is correct |
32 |
Correct |
1026 ms |
5196 KB |
Output is correct |
33 |
Correct |
963 ms |
5068 KB |
Output is correct |
34 |
Correct |
0 ms |
332 KB |
Output is correct |
35 |
Correct |
1 ms |
460 KB |
Output is correct |
36 |
Correct |
13 ms |
844 KB |
Output is correct |
37 |
Correct |
33 ms |
3148 KB |
Output is correct |
38 |
Correct |
776 ms |
5188 KB |
Output is correct |
39 |
Correct |
1025 ms |
5164 KB |
Output is correct |
40 |
Correct |
47 ms |
1588 KB |
Output is correct |
41 |
Correct |
156 ms |
3276 KB |
Output is correct |
42 |
Correct |
31 ms |
3916 KB |
Output is correct |
43 |
Correct |
1159 ms |
5316 KB |
Output is correct |
44 |
Correct |
1113 ms |
5204 KB |
Output is correct |
45 |
Correct |
787 ms |
5236 KB |
Output is correct |
46 |
Correct |
13 ms |
2764 KB |
Output is correct |
47 |
Correct |
29 ms |
4044 KB |
Output is correct |
48 |
Correct |
26 ms |
3836 KB |
Output is correct |