1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <stack>
#include <bitset>
//#include <unordered_set>
//#include <unordered_map>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
typedef short int sint;
#define FOR(x, b, e) for(int x=(b); x<=(e); ++x)
#define FORD(x, b, e) for(int x=((int)(b))-1; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v,n) typeof(n) v=(n)
#define ALL(c) c.begin(),c.end()
#define SIZE(x) ((int)((x).size()))
#define FOREACH(i,c) for(VAR(i,(c).begin());i!=(c).end();++i)
#define PB push_back
#define ST first
#define ND second
#define mp(x,y) make_pair(x,y)
#define DEBUG 1
#define debug(x) {if (DEBUG)cerr <<#x <<" = " <<x <<endl; }
#define debugv(x) {if (DEBUG) {cerr <<#x <<" = "; FOREACH(it, (x)) cerr <<*it <<", "; cout <<endl; }}
#define REMAX(a,b) (a)=max((a),(b));
#define REMIN(a,b) (a)=min((a),(b));
#define wez(n) int (n); scanf("%d",&(n));
#define wez2(n,m) int (n),(m); scanf("%d %d",&(n),&(m));

const int N = 400100;

pii operator-(const pii& a, const pii& b) {
	return mp(a.ST - b.ST, a.ND - b.ND);
}

ll det(const pii& a, const pii& b) {
	return (ll)a.ST*b.ND - (ll)a.ND*b.ST;
}

struct Pkt {
	pii pos;
	int val;
};
Pkt zbior[N];

int kolZam[N];
int n, m;
int w, h;

bool jaki(int x) {
	return x >= n;
}

pii wek;
bool ZamiatanieOperator(const int& a, const int& b) {
	ll z = det(wek, zbior[b].pos - zbior[a].pos);
	if (z != 0) {
		return z < 0;
	}
	bool aJaki = jaki(a), bJaki = jaki(b);
	if (aJaki != bJaki) {
		return aJaki > bJaki;
	}
	return a < b;
}

struct KolOp {
	bool operator()(const int&a, const int&b) const {
		ll z = det(wek, zbior[b].pos - zbior[a].pos);
		if (z != 0) {
			return z > 0;
		}
		bool aJaki = jaki(a), bJaki = jaki(b);
		if (aJaki != bJaki) {
			return aJaki > bJaki;
		}
		return a < b;
	}
};

int main() {
	scanf("%d %d", &n, &m);
	scanf("%d %d", &w, &h);
	REP(i, n) {
		scanf("%d %d %d", &zbior[i].pos.ST, &zbior[i].pos.ND, &zbior[i].val);
	}
	REP(i, m) {
		scanf("%d %d %d", &zbior[n+i].pos.ST, &zbior[n+i].pos.ND, &zbior[n+i].val);
	}
	REP(i, m + n) {
		kolZam[i] = i;
	}
	wek = mp(w, -h);
	sort(kolZam, kolZam + m + n, ZamiatanieOperator);
	wek = mp(-w, -h);
	ll res = 0;
	set<int, KolOp> secik;
	REP(i, m + n) {
		int x = kolZam[i];
		if (x >= n) {
			secik.insert(x);
		} else {
			auto p = secik.lower_bound(x);
			int zost = zbior[x].val;
			while (p != secik.begin()) {
				--p;
				int ile = min(zost, zbior[*p].val);
				if (ile == zbior[*p].val) {
					p = secik.erase(p);
					zost -= ile;
				} else {
					zbior[*p].val -= ile;
					zost = 0;
					break ;
				}
			}
			if (zost > 0) {
				res += zost;
			}
		}
	}
	printf("%lld\n", res);
	return 0;
}