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
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <queue>
#include <bitset>		//UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <iomanip>		//do setprecision
#include <ctime>
#include <complex>
using namespace std;

#define FOR(i,b,e) for(int i=(b);i<(e);++i)
#define FORQ(i,b,e) for(int i=(b);i<=(e);++i)
#define FORD(i,b,e) for(int i=(b)-1;i>=(e);--i)
#define REP(x, n) for(int x = 0; x < (n); ++x)

#define ST first
#define ND second
#define PB push_back
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double

const double pi = 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342;

#define MR 200010

pair < pair < int, int >, int > t1[MR], t2[MR];

int done[MR];

vector < int > pre[MR];

int main()
{
	int n, m, w, h;
	scanf("%d%d%d%d", &n, &m, &w, &h);
	REP(i,n) scanf("%d%d%d", &t1[i].ST.ST, &t1[i].ST.ND, &t1[i].ND);
	REP(i,m) scanf("%d%d%d", &t2[i].ST.ST, &t2[i].ST.ND, &t2[i].ND);
	REP(i,n)REP(j,m)
	{
		//czy i-ty przedmiot widziany przez j-tego straznika
		LL det1 = w*(LL)(t1[i].ST.ND-t2[j].ST.ND)+(t1[i].ST.ST-t2[j].ST.ST)*(LL)h;
		LL det2 = -w*(LL)(t1[i].ST.ND-t2[j].ST.ND)+(t1[i].ST.ST-t2[j].ST.ST)*(LL)h;
		if(det1 <= 0 && det2 >=0)
			pre[i].PB(j);
	}
	//spr kazdy podzbior przedmiotow
	int end = 1<<n;
	LL res = 0;
	FOR(mask,1,end)
	{
		LL sum = 0;
		REP(i,n)
			if(mask&(1<<i))
			{
				sum += t1[i].ND;
				REP(j,(int)pre[i].size())
					if(done[pre[i][j]] != mask)
					{
						done[pre[i][j]] = mask;
						sum -= t2[pre[i][j]].ND;
					}
			}
		res = max(res, sum);
	}
	printf("%lld\n", res);
	return 0;
}