HDOJ 2120 Ice_cream's world I (并查集)

Ice_cream's world I

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 898    Accepted Submission(s): 526

Problem Description

ice_cream's world is a rich country, it has many fertile lands. Today, the queen of ice_cream wants award land to diligent ACMers. So there are some watchtowers are set up, and wall between watchtowers be build, in order to partition the ice_cream’s world. But how many ACMers at most can be awarded by the queen is a big problem. One wall-surrounded land must be given to only one ACMer and no walls are crossed, if you can help the queen solve this problem, you will be get a land.

 

 

Input

In the case, first two integers N, M (N<=1000, M<=10000) is represent the number of watchtower and the number of wall. The watchtower numbered from 0 to N-1. Next following M lines, every line contain two integers A, B mean between A and B has a wall(A and B are distinct). Terminate by end of file.

 

 

Output

Output the maximum number of ACMers who will be awarded.
One answer one line.

 

 

Sample Input

  
  

   
   8 10
0 1
1 2
1 3
2 4
3 4
0 5
5 6
6 7
3 6
4 7
  
  

 

 

Sample Output

  
  

   
   3
  
  

 

//判断有几个环，环中没有灯塔，没有任何东西，简简单单的并查集，最后判断一共有几个重边

#include<cstdio>
int per[1111];
int k=0;
int find(int x)
{
    int t=x;
    while (t!=per[t])
    t=per[t];
    per[x]=t;
    return t;
}
void un(int a,int b)
{
    int xa = find(a);
    int xb = find(b);
    if (xb!=xa)
    per[xb]=xa;
    else
    k++;
}
int main()
{
    int x,n,m,y;
    while (~scanf ("%d%d",&n,&m))
    {
        k=0;
        for (int i=0;i<n;i++)
        {
            per[i]=i;
        }
        while (m--)
        {
            scanf ("%d%d",&x,&y);
            un(x,y);
        }
        printf ("%d\n",k);
    }
    return 0;
}

 

 

 

 

 

 

 

 

 

搜索