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
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <algorithm>
#include <sstream>
#include <stack>
#include <cstring>
#include <iomanip>
#include <ctime>
using namespace std;
#define pb push_back
#define FOR(i,n) for(int (i)=0;(i)<(n);++(i))
#define FORI(i,n) for(int (i)=1;(i)<=(n);++(i))
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define vi vector<int>
#define SZ(x) ((int)((x).size()))
#define fi first
#define se second
#define wez(n) int (n); scanf("%d",&(n));
#define wez2(n,m) int (n),(m); scanf("%d %d",&(n),&(m));
#define wez3(n,m,k) int (n),(m),(k); scanf("%d %d %d",&(n),&(m),&(k));
inline void pisz(int n) { printf("%d\n",n); }
template<typename T,typename TT> ostream& operator<<(ostream &s,pair<T,TT> t) {return s<<"("<<t.first<<","<<t.second<<")";}
template<typename T> ostream& operator<<(ostream &s,vector<T> t){FOR(i,SZ(t))s<<t[i]<<" ";return s; }
#define DBG(vari) cerr<<#vari<<" = "<<(vari)<<endl;
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (__typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define TESTS wez(testow)while(testow--)
#define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
#define REMAX(a,b) (a)=max((a),(b));
#define REMIN(a,b) (a)=min((a),(b));
#define IOS ios_base::sync_with_stdio(0);

const ll LINF = 3001001001001001001LL;
vector<pair<pair<ll,ll>,ll> > ev;
ll _w, _h;
void wstaw (int mn) {
   ll xpp, ypp, val;
   scanf("%lld %lld %lld", &xpp, &ypp, &val);
   ll xp = _h * xpp, yp = _w * ypp;
   ll a = - yp + xp, b = - xp - yp;
   ev.pb(mp(mp(a, mn * val), b));
}
struct para {
   ll first;
   mutable ll second;
   para (ll _first, ll _second) : first(_first), second(_second) {}
   bool operator < (const para &p) const {
      if (first != p.first) return first < p.first;
      return second < p.second;
   }
};

int main () {
   int n, m;
   scanf("%d %d %lld %lld", &n, &m, &_w, &_h);
   FORI(i,n) { // skarby
      wstaw(+1);
   }
   FORI(i,m) { // straznicy
      wstaw(-1);
   }
   sort(ALL(ev));
   set<para> miotla;
   miotla.insert(para(-LINF,0));
   FOREACH(iter,ev) {
      ll val = iter->fi.se, b = iter->se;
      set<para>::iterator it = prev(miotla.upper_bound(para(b,LINF)));
      if (val < 0) {
         // straznik
         if (it->fi != b) {
            miotla.insert(next(it) /* C++11! */, para(b, val));
         } else {
            it->se += val;
         }
      } else {
         // skarb
         it->se += val;
         while (it->se >= 0 && it != miotla.begin()) {
            set<para>::iterator jt = prev(it);
            jt->se += it->se;
            miotla.erase(it);
            it = jt;
         }
      }
   }
   cout << miotla.begin()->se << endl;
}