Gym - 100781G- Goblin Garden Guards

/*
 对于每个喷洒点，遍历这个圆的外切正方形内的所有点
*/

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
const  int maxn = 1e5+10;
const int N = 1e4 + 10;
struct Point
{
    int x,y;
} p[maxn];
bool vis[N][N];
void judge(int R,int x,int y,int left,int right,int up,int down)
{
    for(int i = left ; i <= right; i++)
    {
        for(int j = down; j <= up; j++)
        {
            if(abs(x - i) * abs(x - i) + abs(y - j) * abs(y - j) <= R * R )
            {
                vis[i][j] = true;
            }
        }
    }
}
int main()
{
    int n,x,y,R,t,left,right,up,down;
    cin>>n;
    int cnt = 0;
    for(int i  = 1; i <= n; i++)
    {
        cin>>p[i].x>>p[i].y;
    }
    cin>>t;
    while(t--)
    {
        cin>>x>>y>>R;
        left = max(0,x - R);
        right = min(10000,x + R);
        up = min(10000,y + R);
        down = max(0,y - R);
        judge(R,x,y,left,right,up,down);
    }
    for(int i = 1; i <= n; i++)
    {
        if(vis[p[i].x][p[i].y] == 0)
            cnt++;
    }
    cout<<cnt<<endl;
    return 0;
}