Wireless Network

An earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aftershock attacked, all computers in the network were all broken. The computers are repaired one by one, and the network gradually began to work again. Because of the hardware restricts, each computer can only directly communicate with the computers that are not farther than d meters from it. But every computer can be regarded as the intermediary of the communication between two other computers, that is to say computer A and computer B can communicate if computer A and computer B can communicate directly or there is a computer C that can communicate with both A and B.

In the process of repairing the network, workers can take two kinds of operations at every moment, repairing a computer, or testing if two computers can communicate. Your job is to answer all the testing operations.
Input
The first line contains two integers N and d (1 <= N <= 1001, 0 <= d <= 20000). Here N is the number of computers, which are numbered from 1 to N, and D is the maximum distance two computers can communicate directly. In the next N lines, each contains two integers xi, yi (0 <= xi, yi <= 10000), which is the coordinate of N computers. From the (N+1)-th line to the end of input, there are operations, which are carried out one by one. Each line contains an operation in one of following two formats:
1. “O p” (1 <= p <= N), which means repairing computer p.
2. “S p q” (1 <= p, q <= N), which means testing whether computer p and q can communicate.

The input will not exceed 300000 lines.
Output
For each Testing operation, print “SUCCESS” if the two computers can communicate, or “FAIL” if not.
Sample Input
4 1
0 1
0 2
0 3
0 4
O 1
O 2
O 4
S 1 4
O 3
S 1 4
Sample Output
FAIL
SUCCESS
有一堆电脑，给出坐标，然后距离不超过d才可以沟通。一开始电脑都是坏的，o操作代表修电脑，s操作判断x与y是否可以联通。
看了数据范围，修的时候判断他周围是否有电脑连上，查询都是简单的并查集。还有，一开始用vector预处理一下，把距离之内的电脑放进去，不然就算修好，也不会联通。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
#include<map>
#include<vector>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int maxn = 1005;
int x[1005], y[1005], p[1005];
vector<int>gather[1005];
bool leap[1005];
int dis(int i, int j)
{
    return (x[i] - x[j])*(x[i] - x[j]) + (y[i] - y[j])*(y[i] - y[j]);
}
void init(int n)
{
    for (int i = 1; i <= n; i++)
        p[i] = i;
}
int find(int x)
{
    return x == p[x] ? x : p[x] = find(p[x]);
}
int main()
{
#ifdef LOCAL
    freopen("C:\\Users\\巍巍\\Desktop\\in.txt", "r", stdin);
    //freopen("C:\\Users\\巍巍\\Desktop\\out.txt","w",stdout);
#endif // LOCAL
    int n, d;
    scanf("%d%d", &n, &d);
    init(n);
    for (int i = 1; i <= n; i++)
        scanf("%d%d", &x[i], &y[i]);
    getchar();
    for (int i = 1; i <= n; i++)gather[i].clear();
    for (int i = 1; i <= n; i++)
    {
        for (int j = i + 1; j <= n; j++)
        {
            if (dis(i, j) <= d*d)
            {
                gather[i].push_back(j);
                gather[j].push_back(i);
            }
        }
    }
    for (int i = 1; i <= n; i++)leap[i] = false;
    char c;
    while (scanf("%c", &c) != EOF)
    {
        if (c == 'O')
        {
            int pin;
            scanf("%d", &pin); getchar();
            leap[pin] = true;
            for (int i = 0; i < gather[pin].size(); i++)
            {
                if (!leap[gather[pin][i]])continue;
                int pp, pi;
                pp = find(pin); pi = find(gather[pin][i]);
                if (pp != pi)
                {
                    p[pi] = pp;
                }
            }
        }
        else
        {
            int pin, q;
            scanf("%d%d", &pin, &q); getchar();
            pin = find(pin); q = find(q);
            if (pin == q)
                printf("SUCCESS\n");
            else
                printf("FAIL\n");
        }
    }
    return 0;
}