POJ 2236 Wireless Network(並查集)

#include<iostream><br />#include<vector><br />using namespace std;<br />struct coord<br />{<br />int x,y;<br />}P[1005];<br />int n,d;<br />char cmd;<br />int fa[1005],x,y;<br />vector<int> ok;<br />void init()<br />{<br />for(int i = 1;i <= n;++i)fa[i] = i;<br />}<br />int Find(int x)<br />{<br />if(x == fa[x])return x;<br />else return fa[x] = Find(fa[x]);<br />}<br />void Union(int x,int y)<br />{<br />x = Find(x);<br />y = Find(y);<br />if(x != y)fa[x] = y;<br />}<br />int calDis(coord a,coord b)<br />{<br />return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);<br />}<br />void check(int x)<br />{<br />for(int i = 0;i < ok.size();++i)<br />if(calDis(P[x],P[ok[i]]) <= d*d)<br />Union(x,ok[i]);<br />ok.push_back(x);<br />}<br />int main()<br />{<br />//freopen("in.txt","r",stdin);<br />scanf("%d%d",&n,&d);<br />for(int i = 1;i <= n;++i)scanf("%d%d",&P[i].x,&P[i].y);<br />init();<br />while(scanf("/n%c",&cmd) != EOF)<br />{<br />if(cmd == 'O')<br />{<br />scanf("%d",&x);<br />check(x);<br />}<br />else<br />{<br />scanf("%d%d",&x,&y);<br />x = Find(x);<br />y = Find(y);<br />if(x != y)printf("FAIL/n");<br />else printf("SUCCESS/n");<br />}<br />}<br />return 0;<br />}<br />