poj 2236 Wireless Network 并查集

简单并查集。n台电脑，两种操作，1 修复x，2查询x y是否连接。是否连接为两台电脑的距离不超过d

#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#define pi acos(-1.0)
#define eps 1e-8
#define asd puts("sdasdasdasdasd");
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int N = 1010;

int fa[N];
int vis[N];
int n;
double d;
struct node{
	double x, y;
}a[N];

void init( )
{
	for( int i = 1; i <= n; i++ )
	{
		fa[i] = i;
		vis[i] = 0;
	}
}

int dfs( int u )
{
	if( u == fa[u] )
		return u;
	else
		return ( fa[u] = dfs( fa[u] ) );
}

int OK( int i, int 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) )
		return 1;
	return 0;
}

void fk( int u )
{
	for( int i = 1; i <= n; i++ )
	{
		if( !vis[i] )
			continue;
		if( OK(i, u) )
		{
			int x = dfs( i );
			fa[x] = u;
		}
	}
}

int main()
{
	while( ~scanf("%d %lf", &n, &d))
	{
		init();
		for( int i = 1; i<= n; ++i )
		{
			scanf("%lf %lf", &a[i].x, &a[i].y);
		}
		char op[2];
		int u, v;
		while( ~scanf("%s", op) )
		{
			if( op[0] == 'O' )
			{
				scanf("%d", &u);
				fk( u );
				vis[u] = 1;
			}
			else
			{
				scanf("%d%d", &u, &v);
				u = dfs( u );
				v = dfs( v );
				if( u == v )
					puts("SUCCESS");
				else
					puts("FAIL");
			}
		}
	}
	return 0;
}