首页 > 代码库 > [并查集] POJ 2236 Wireless Network

[并查集] POJ 2236 Wireless Network

2024-08-27 12:49:27   218人阅读

Wireless Network
Time Limit: 10000MS   Memory Limit: 65536K
Total Submissions: 25022   Accepted: 10399

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. 

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

Source

POJ Monthly,HQM
原题大意：给两个整数N和d，N为电脑的个数，d为无线传播的最远距离。
              接下来给N行，表示N台电脑的坐标。
              直到输入结束，都会输入一个字符，如果为O，则再输入一个整数x表示编号为x的电脑被修好。
              如果为S，再输入两个整数x,y，询问x与y之间是否连通。
解题思路：对于每台电脑一旦修好，判断与它可以连通的点的集合并合并。
              询问的时候用并查集寻找即可。其实还是一个裸并查集。
#include<stdio.h>
#include<string.h>
#include<math.h>
#define dist(x1,y1,x2,y2) (x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)
int father[10050],n,d;
bool ingragh[10050];
struct node
  {
  	 int x,y;
  }node[10050];
int find(int x)
  {
  	 if(x==father[x]) return (x);
  	 else father[x]=find(father[x]);
  	 return (father[x]);
  }
void merge(int x,int y)
  {
  	 int find_x=find(x);
  	 int find_y=find(y);
  	 if(find_x!=find_y&&dist(node[x].x,node[x].y,node[y].x,node[y].y)<=d*d) 
	       father[find_x]=find_y;
  	 return;
  }
void init()
  {
  	 int i;
  	 for(i=1;i<=n;++i) father[i]=i;
  	 memset(ingragh,false,sizeof(ingragh));
  }
int main()
  {
  	 int i,query1,query2;
  	 char c;
  	 scanf("%d%d",&n,&d);
  	 init();
  	 for(i=1;i<=n;++i) scanf("%d%d",&node[i].x,&node[i].y);
	 while(~scanf("%c%d",&c,&query1))
	   {
	   	  if(c==‘O‘) 
			 {
			    for(i=1;i<=n;++i) if(ingragh[i]) merge(i,query1);
			    ingragh[query1]=true;
		     }
		  else
	   	  if(c==‘S‘)
	   	    {
	   	  	   scanf("%d",&query2);
	   	  	   if(ingragh[query1]&&ingragh[query2])
	   	  	     {
				    if(find(query1)==find(query2)) 
					   {
					     printf("SUCCESS\n");
				         continue;
				       }
			     } 
			   printf("FAIL\n");
		    }
	   }
  	 return 0;
  }

　　

[并查集] POJ 2236 Wireless Network


联系
我们