//pku 2236
#include "stdio.h"

int n,d;
int f[1005];
int flag[1005];

struct node
{
       int x;
       int y;
}com[1005];

int getfather(int p)
{
   int father;
   if(f[p]==p) father=p;
   else {
       int k=getfather(f[p]);
       f[p]=k;
       father=f[p];
   }
   return father;
}

void solve(int p)
{
    flag[p]=1;
    int s=getfather(p);
    for(int i=1;i<=n;i++)
    {
         if(flag[i]&&i!=p)
         {
             if((com[p].x-com[i].x)*(com[p].x-com[i].x)+(com[p].y-com[i].y)*(com[p].y-com[i].y)<=d*d)
             {
                 int t=getfather(i);
                 if(s!=t)
                 f[t]=s;
             }
         }            
    }
    
}

void ans(int p,int q)
{
     if(getfather(p)==getfather(q)) printf("SUCCESS\n");
     else printf("FALL\n");
}

int main()
{   
    scanf("%d%d",&n,&d);
    for(int i=1;i<=n;i++)
    {
        scanf("%d%d",&com[i].x,&com[i].y);  
        f[i]=i;                      
        flag[i]=0;
    }    
    char ch;
    while(getchar(),scanf("%c",&ch)!=EOF)
    {
       if(ch=='O')
       {
           int p;
           scanf("%d",&p);
           solve(p);                      
       }        
       else if(ch=='S')
       {
           int p,q;
           scanf("%d%d",&p,&q);
           ans(p,q);
       }    
    }
   return 0;
}

• Re:又搞了2个小时，还是不知道哪里错了...谁能给小弟几组数据，谢谢了 (1537) lxp_rs 2006-08-21 09:34:16
  • Re:faint .问题找到啦，居然把FAIL写成FALL! (0) lxp_rs 2006-08-21 19:54:06
    • Re:faint .问题找到啦，居然把FAIL写成FALL! (7) tkchenhetian 2008-03-19 13:29:10