poj 2236 Wireless Network

题目链接:http://poj.org/problem?id=2236

题目大意:

有n台(1<=n<=1001)电脑坏掉了.

两种操作(操作的次数不超过300000个.):

(1)修复一台电脑.

(2)询问两台电脑是否可以连接.(直接或间接)

ps:直接相连:

两台电脑的距离小于d.

间接相连:

假设电脑A和B的距离大于d,但电脑C和A,B的距离小于d,则A和B间接相连.

题目思路:

运用并查集把相连的电脑放入一个集合。

修复电脑( O(n) ):

把所有能和它直接或间接相连的电脑指向它.

询问( O(1) ):

两电脑的祖先相同即相连.

假设操作的次数是m。

那么复杂度看起来貌似是O(m*n)

但是电脑最多只有n台，所以复杂度应该是O( max(n*n,m) );

代码:

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;

#define ll long long
#define ls rt<<1
#define rs ls|1
#define lson l,mid,ls
#define rson mid+1,r,rs
#define middle (l+r)>>1
#define eps (1e-8)
#define type int
#define clr_all(x,c) memset(x,c,sizeof(x))
#define clr(x,c,n) memset(x,c,sizeof(x[0])*(n+1))
#define MOD 1000000009
#define INF 0x3f3f3f3f
#define pi acos(-1.0)
#define _max(x,y) (((x)>(y))? (x):(y))
#define _min(x,y) (((x)<(y))? (x):(y))
#define _abs(x) ((x)<0? (-(x)):(x))
#define getmin(x,y) (x= (x<0 || (y)<x)? (y):x)
#define getmax(x,y) (x= ((y)>x)? (y):x)
template <class T> void _swap(T &x,T &y){T t=x;x=y;y=t;}
int TS,cas=1;
const int M=1001+5;
int n,d;
int fa[M],x[M],y[M],dis[M][M],vis[M];

int find(int x){
	return (x==fa[x])? x:(fa[x]=find(fa[x]));
}

int getdis(int i,int j){
	return (x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]);
}

void run(){
    int i,j;
	scanf("%d%d",&n,&d);
	d*=d;
	for(i=1;i<=n;i++) fa[i]=i;
	for(i=1;i<=n;i++) scanf("%d%d",&x[i],&y[i]);
	for(i=1;i<=n;i++){
		dis[i][i]=d+1;
		for(j=i+1;j<=n;j++)
			dis[j][i]=dis[i][j]=getdis(i,j);
	}
	clr(vis,0,n);
	char op[2];
	int p,q;
	while(~scanf("%s",op)){
		if(op[0]=='O'){
			scanf("%d",&p);
			if(vis[p]) continue;
			vis[p]=1;
			for(i=1;i<=n;i++)
				if(vis[i] && dis[i][p]<=d)
					fa[find(i)]=p;
		}
		else{
			scanf("%d%d",&p,&q);
			if(find(p)==find(q)) puts("SUCCESS");
			else puts("FAIL");
		}
	}
}

void preSof(){
}

int main(){
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    preSof();
    run();
    //while(~scanf("%d%d",&n,&d)) run();
    //for(scanf("%d",&TS);cas<=TS;cas++) run();
    return 0;
}