poj2236WirelessNetwork 并查集

#pragma warning(disable:4996)
#include<iostream>
#include<string>
#include<cmath>
#include<ctype.h>
#include<string.h>
#include<algorithm>
#include<map>
#include<iomanip>
#include<set>
#include<list>
#include<vector>
#include<stack>
#include<queue>
#define ll long long int
using namespace std;
const int maxn = 2020;

int n, d;
struct node
{
	int x, y;
};
node a[maxn];
int par[maxn];
bool iswork[maxn];

int Map[maxn][maxn];

int find(int x)
{
	if (par[x] == x)
		return par[x];
	return par[x] = find(par[x]);
}


int main()
{
	cin >> n >> d;
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i].x >> a[i].y;
		par[i] = i;
	}

	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
		{
			if ((a[i].x - a[j].x) * (a[i].x - a[j].x) + (a[i].y - a[j].y) * (a[i].y - a[j].y) <= d * d)
			{
				Map[i][j] = j;
				Map[j][i] = i;
			}
		}

	char c;
	while (cin >> c)
	{
		if (c == 'O')
		{
			int num; cin >> num;
			iswork[num] = 1;

			for (int i = 1; i <= n; i++)
			{
				if (iswork[Map[num][i]])
				{
					int f = find(Map[num][i]);
					par[f] = num;
				}
			}
		}
		else//test
		{
			int a, b;
			cin >> a >> b;
			int fa = find(a);
			int fb = find(b);
			if (fa == fb)
				cout << "SUCCESS" << endl;
			else
				cout << "FAIL" << endl;
		}
	}
	return 0;
}