Wireless Network POJ - 2236

维护是否在一个集合，修护距离即可

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
#define mem(a,b) memset(a,b,sizeof(a))
struct node{
  int x,y;
};
node nodes[1010];
vector<int> connect[1010];
bool worked[1010];
int u,v;
int N,d;
int U[1010];
char str[1010];
int Find(int i) {
  return U[i] == i ? i : (U[i] = Find(U[i]));
}
void Union(int i,int j) {
  i = Find(i);
  j = Find(j);
  U[i] = j;
}
void solve(){
  while(gets(str)){
    if (str[0] == '\0') break;
    if (str[0] == 'S'){
      sscanf(str,"S %d%d",&u,&v);
      if (Find(u) != Find(v)){
        printf("FAIL\n");
      } else {
        printf("SUCCESS\n");
      }
    } else {
      sscanf(str,"O %d",&v);
      worked[v] = true;
      for (int i  = 0 ;i <connect[v].size() ;i ++) {
        if (worked[connect[v][i]]){
          Union(v,connect[v][i]);
        }
      }
    }
  }

}
int main()
{
  scanf("%d%d",&N,&d);
  for (int i = 1;i<=N;i++) {
    scanf("%d%d",&u,&v);
    nodes[i].x = u; nodes[i].y = v;
    connect[i].clear();
    U[i] = i;
  }
  getchar();
  mem(worked,0);
  for (int i = 1;i<=N;i++){
    for (int j = i + 1 ;j <= N ;j++) {
      int dist = (nodes[j].x - nodes[i].x) * (nodes[j].x - nodes[i].x) + (nodes[j].y - nodes[i].y) * (nodes[j].y - nodes[i].y);
      if (dist <= d * d){
        connect[i].push_back(j);
        connect[j].push_back(i);
      }
    }
  }
  solve();
  return 0;
}