CodeForces - 33D Knights【水题】

题目链接：https://codeforces.com/contest/33/problem/D

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <climits>
#include <cstring>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define lowbit(x) (x & (-x))
#define CASET int _; scanf("%d", &_); for(int kase=1;kase<=_;kase++)

typedef double db;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;

static const int INF=0x3f3f3f3f;
static const ll INFL=0x3f3f3f3f3f3f3f3f;
static const db EPS=1e-10;
static const db PI=acos(-1.0);
static const int MOD=1e9+7;

template <typename T>
inline void read(T &f) {
    f = 0; T fu = 1; char c = getchar();
    while (c < '0' || c > '9') { if (c == '-') { fu = -1; } c = getchar(); }
    while (c >= '0' && c <= '9') { f = (f << 3) + (f << 1) + (c & 15); c = getchar(); }
    f *= fu;
}
template <typename T>
void print(T x) {
    if (x < 0) putchar('-'), x = -x;
    if (x < 10) putchar(x + 48);
    else print(x / 10), putchar(x % 10 + 48);
}
static const int MAXN=1e3+10;
int kx[MAXN],ky[MAXN];
int r[MAXN],cx[MAXN],cy[MAXN];
bool in[MAXN][MAXN];
int n,m,k,x,y;
int main()
{
    read(n); read(m); read(k);
    for(int i=1;i<=n;i++) read(kx[i]),read(ky[i]);
    for(int i=1;i<=m;i++) read(r[i]),read(cx[i]),read(cy[i]);
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            if(1ll*(kx[i]-cx[j])*(kx[i]-cx[j])+1ll*(ky[i]-cy[j])*(ky[i]-cy[j])<1ll*r[j]*r[j]) in[i][j]=true;
    while(k--)
    {
        read(x); read(y);
        int ans=0;
        for(int i=1;i<=m;i++)
            if(in[x][i] && !in[y][i] || !in[x][i] && in[y][i]) ans++;
        printf("%d\n",ans);
    }
    return 0;
}