pku2492 A Bug’s Life

來源:互聯網
上載者:User

題目意思:一夫一妻制,呵呵。赤裸裸的並查集。

<code>

 

#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
#define maxs 2000
#define maxn 4005
int father[maxn];
void Make_Set()
{
   for(int i=1;i<=maxn;i++)
     father[i]=i;
}
int Find_Set(int x)//²éÕÒÒ»¸öÔªËØËùÔÚ¼¯ºÏ
{
    if(x!=father[x])
    {
       father[x]=Find_Set(father[x]);//µÝ¹é²éÕÒ
    }
    return father[x];
}

void Union(int x,int y)
{
   x=Find_Set(x),y=Find_Set(y);
   if(x<y)
      father[y]=x;
   else if(x>y)
      father[x]=y;
}
int main()
{
    int T,n,m,i,j;
    int x,y;
    int ca=0;
    scanf("%d",&T);
    while(T--)
    {
    
      Make_Set();
      scanf("%d%d",&n,&m);
      for(i=1;i<=m;i++)
      {
         scanf("%d%d",&x,&y);
         if(Find_Set(x)==Find_Set(y))break;
         Union(x,y+maxs);
         Union(x+maxs,y);
      }
      for(j=i+1;j<=m;j++)
        scanf("%d%d",&x,&y);
      printf("Scenario #%d:/n",++ca);
      if(i<=m)
        printf("Suspicious bugs found!/n/n");
      else
        printf("No suspicious bugs found!/n/n");
    }
    system("pause");
    return 0;
}


    

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.