cowlibi.cpp

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

struct Garden {
    ll x, y, t;
    ll dist(Garden to) {
        return abs(to.x - x)+abs(to.y - y);
    }
    bool reachable(Garden to) {
        return dist(to) <= abs(to.t - t);
    }
};
int main() {
    ll ngardens, ncows;
    cin >> ngardens >> ncows;
    map<ll, Garden> gardens = {};
    set<ll> times = {};
    for (ll i = 0; i < ngardens; i++) {
        ll x, y, t;
        cin >> x >> y >> t;
        gardens[t] = {x,y,t};
        times.insert(t);
    }
    ll total = 0;
    for (ll i = 0; i < ncows; i++) {
        ll x, y, t;
        cin >> x >> y >> t;
        auto g = Garden {x,y,t};
        bool good;
        auto bound = times.lower_bound(t);
        if (bound == times.begin()) {
            good = g.reachable(gardens[*bound]);
        } else if (bound == times.end()) {
            good = g.reachable(gardens[*prev(bound)]);
        } else {
            ll second = *bound;
            ll first = *prev(bound);
            good = g.reachable(gardens[first]) && g.reachable(gardens[second]);
        }
        total += !good;
    }
    cout << total << endl;
}