弄了一下午࿰c;终于把这个也弄AC了。

刚开始想修好一个后和已知的循环求距离然后合并࿰c;一想担心时间肯定不够࿰c;然后又看了网上的阶梯报告࿰c;结果就是这样࿰c;悲哀呀            (ˇˍˇ）  回头一看题目时间是10000MS。。。 

c</a>ode" <a class="tags" href="/tags/C.html" title=c>c</a>lass="<a class="tags" href="/tags/C.html" title=c>c</a>-sharp">#in<a class="tags" href="/tags/C.html" title=c>c</a>lude "<a <a class="tags" href="/tags/C.html" title=c>c</a>lass="tags" href="/tags/IOSTREAM.html" title=iostream>iostream</a>" #in<a class="tags" href="/tags/C.html" title=c>c</a>lude "stdio.h" #in<a class="tags" href="/tags/C.html" title=c>c</a>lude "<a class="tags" href="/tags/C.html" title=c>c</a>math" using namespa<a class="tags" href="/tags/C.html" title=c>c</a>e std; stru<a class="tags" href="/tags/C.html" title=c>c</a>t point { unsigned int x,y; int set; }r[1003]; int make(int n) { int i; for(i=0; i<=n; i++) r[i].set=i; } int find(int x) { if(x!=r[x].set) r[x].set=find(r[x].set); return r[x].set; } int Union(int rx,int ry) { if(rx==ry) return 0; r[ry].set=rx; } int main() { int i,j,x,y,e,o<a class="tags" href="/tags/C.html" title=c>c</a>,m,d,n; int a,b,rx,ry; double dis; int hasre[1003]; <a class="tags" href="/tags/C.html" title=c>c</a>har <a class="tags" href="/tags/C.html" title=c>c</a>; s<a class="tags" href="/tags/C.html" title=c>c</a>anf("%d%d",&n,&d); make(n); for(e=1; e<=n; e++) s<a class="tags" href="/tags/C.html" title=c>c</a>anf("%d%d",&r[e].x,&r[e].y); o<a class="tags" href="/tags/C.html" title=c>c</a>=1; while(s<a class="tags" href="/tags/C.html" title=c>c</a>anf("/n%<a class="tags" href="/tags/C.html" title=c>c</a> %d",&<a class="tags" href="/tags/C.html" title=c>c</a>,&a)!=EOF) { if(<a class="tags" href="/tags/C.html" title=c>c</a>=='O') { hasre[o<a class="tags" href="/tags/C.html" title=c>c</a>++]=a; for(j=1; j<o<a class="tags" href="/tags/C.html" title=c>c</a>; j++) { dis=(r[hasre[j]].x-r[a].x)*(r[hasre[j]].x-r[a].x)+ (r[hasre[j]].y-r[a].y)*(r[hasre[j]].y-r[a].y); // <a class="tags" href="/tags/C.html" title=c>c</a>out<<"dis="<<dis<<endl; if(dis<=d*d) { rx=find(a); ry=find(hasre[j]); Union(rx,ry); } } } else { s<a class="tags" href="/tags/C.html" title=c>c</a>anf("%d",&b); rx=find(a); ry=find(b); if(rx==ry) printf("SUCCESS/n"); else printf("FAIL/n"); } } <a <a class="tags" href="/tags/C.html" title=c>c</a>lass="tags" href="/tags/SYSTEM.html" title=system>system</a>("pause"); return 0; }