http://poj.org/problem?id=2236
http://www.hankcs.com/program/cpp/poj-2236-wireless-network-solution-to-a-problem-challenge-programming-contest.html
平方计算太多了，初始化的时候算一次记录在一个二维数组中就够了。
Read full article from 2236 -- Wireless Network
Description
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.
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.
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
题意：
有一个计算机网络的所有线路都坏了，网络中有n台计算机，现在你可以做两种操作，修理（O）和检测两台计算机是否连通（S），只有修理好的计算机才能连通。连通有个规则，两台计算机的距离不能超过给定的最大距离D（一开始会给你n台计算机的坐标）。检测的时候输出两台计算机是否能连通。
思路：
每次修理好一台计算机的时候就遍历一下所有修好的计算机，看距离是否<=D，如果符合说明可以连通，将两台计算机所在集合合并。
每次检查的时候判断一下这两台计算机是否在同一集合中即可。
注意：
1、坐标之后给出的计算机编号都是n+1的。例如O 3，他实际上修理的是编号为2的计算机，因为计算机是从0开始编号的。
2、比较距离的时候注意要用浮点数比较，否则会WA。
3、"FAIL"不要写成"FALL"。
4、字符串输入的时候注意处理好回车，空格等情况。
5、注意N的范围（1 <= N <= 1001），最大是1001，不是1000。是个小坑，数组开小了可能会错哦。
另外测试了一下使用路径压缩，和不使用路径压缩的效率。使用是1079MS（C++），不使用是2032MS（C++），时间缩短了一倍。
另外C++和G++提交时间相差也很大。同样的代码G++就变成了3063MS（G++）。
http://www.hankcs.com/program/cpp/poj-2236-wireless-network-solution-to-a-problem-challenge-programming-contest.html
#define MAX_N 1001 + 16int parent[MAX_N];int height[MAX_N];bool status[MAX_N];int distance[MAX_N][MAX_N];void init(const int& n){ for (int i = 0; i < n; ++i) { parent[i] = i; height[i] = 0; }}int find(const int& x){ if (parent[x] == x) { return x; } else { return parent[x] = find(parent[x]); }}void unite(int x, int y){ x = find(x); y = find(y); if (x == y) { return; } if (height[x] < height[y]) { parent[x] = y; } else { parent[y] = x; if (height[x] == height[y]) { ++height[x]; } }}bool same(const int& x, const int& y){ return find(x) == find(y);}pair<int, int> computer[MAX_N];int square(const int& x){ return x * x;}///////////////////////////SubMain//////////////////////////////////int main(int argc, char *argv[]){#ifndef ONLINE_JUDGE freopen("in.txt", "r", stdin); freopen("out.txt", "w", stdout);#endif int N, d; cin >> N >> d; for (int i = 0; i < N; ++i) { cin >> computer[i].first >> computer[i].second; } init(N); char operation; int x, y; while (cin >> operation) { if (operation == 'O') { cin >> x; --x; status[x] = true; for (int i = 0; i < N; ++i) { if (i == x) { continue; } if (status[i] && square(computer[x].first - computer[i].first) + square(computer[x].second - computer[i].second) <= square(d)) { unite(x, i); } } } else { cin >> x >> y; --x; --y; if (same(x, y)) { cout << "SUCCESS" << endl; } else { cout << "FAIL" << endl; } } }#ifndef ONLINE_JUDGE fclose(stdin); fclose(stdout); system("out.txt");#endif return 0;}#define MAX_N 1001 + 16int parent[MAX_N];int height[MAX_N];bool status[MAX_N];bool able[MAX_N][MAX_N];void init(const int& n){ for (int i = 0; i < n; ++i) { parent[i] = i; height[i] = 0; }}int find(const int& x){ if (parent[x] == x) { return x; } else { return parent[x] = find(parent[x]); }}void unite(int x, int y){ x = find(x); y = find(y); if (x == y) { return; } if (height[x] < height[y]) { parent[x] = y; } else { parent[y] = x; if (height[x] == height[y]) { ++height[x]; } }}bool same(const int& x, const int& y){ return find(x) == find(y);}pair<int, int> computer[MAX_N];int square(const int& x){ return x * x;}///////////////////////////SubMain//////////////////////////////////int main(int argc, char *argv[]){#ifndef ONLINE_JUDGE freopen("in.txt", "r", stdin); freopen("out.txt", "w", stdout);#endif int N, d; cin >> N >> d; for (int i = 0; i < N; ++i) { cin >> computer[i].first >> computer[i].second; } init(N); for (int i = 0; i < N; ++i) { for (int x = i; x < N; ++x) { if (square(computer[x].first - computer[i].first) + square(computer[x].second - computer[i].second) <= square(d)) { able[i][x] = true; able[x][i] = true; } } } char operation; int x, y; while (cin >> operation) { if (operation == 'O') { cin >> x; --x; status[x] = true; for (int i = 0; i < N; ++i) { if (i == x) { continue; } if (status[i] && able[x][i]) { unite(x, i); } } } else { cin >> x >> y; --x; --y; if (same(x, y)) { cout << "SUCCESS" << endl; } else { cout << "FAIL" << endl; } } }#ifndef ONLINE_JUDGE fclose(stdin); fclose(stdout); system("out.txt");#endif return 0;}