NYOJ_129_树的判定 _【并差集】

树的判定
时间限制：1000 ms  |  内存限制：65535 KB
难度：4

描述

    A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes
    connected by directed edges between nodes satisfying the following properties.

    There is exactly one node, called the root, to which no directed edges point.
    Every node except the root has exactly one edge pointing to it.
    There is a unique sequence of directed edges from the root to each node.

    For example, consider the illustrations below, in which nodes are represented by circles and edges are represented by lines
     with arrowheads. The first two of these are trees, but the last is not.


    In this problem you will be given several descriptions of collections of nodes connected by directed edges. For each of
     these you are to determine if the collection satisfies the definition of a tree or not.

输入
    The input will consist of a sequence of descriptions (test cases) followed by a pair of negative integers. Each test case
    will consist of a sequence of edge descriptions followed by a pair of zeroes Each edge description will consist of a pair
     of integers; the first integer identifies the node from which the edge begins, and the second integer identifies the node
      to which the edge is directed. Node numbers will always be greater than zero.

    The number of test cases will not more than 20,and the number of the node will not exceed 10000.
    The inputs will be ended by a pair of -1.
输出
    For each test case display the line "Case k is a tree." or the line "Case k is not a tree.", where k corresponds to the test
     case number (they are sequentially numbered starting with 1).
样例输入

6 8  5 3  5 2  6 4 5 6  0 0

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

3 8  6 8  6 4 5 3  5 6  5 2  0 0

-1 -1

样例输出

    Case 1 is a tree.
    Case 2 is a tree.
    Case 3 is not a tree.
*/
/*

树的判定  

1.没有环

2.每个结点的入度不能大于1

3.结点数 = 边数 + 1

*/

#include<stdio.h>
const int MAXN = 10010;
int flag[MAXN], father[MAXN];
int s[MAXN];//判断入度 

void Init()
{
    for(int i = 0; i < MAXN; i++)
        flag[i] = 0, father[i] = i, s[i] = 0;
}

int Find(int x)
{
    if(x == father[x])
    {
    	return x;
    }
    else
    {
    	return father[x] = Find(father[x]);
    }
}

void Merge(int a, int b)
{
    int p = Find(a);
    int q = Find(b);
    if(p!=q)
    {
		father[p] = q;
	}
}

int main()
{
	int i;
    int a, b, con = 1;
    while(~scanf("%d%d",&a,&b) && a>=0 && b>=0)
    {
    	if(a==0 && b==0)//树为空,这个地方wa了好久 
    	{
    		printf("Case %d is a tree.\n",con++);
    		continue;
    	}
        Init();
        int FLAG = 0;
        while(1)
        {
            if(a == 0 && b == 0)
                break;
            if(Find(a) == Find(b))
                FLAG = 1;
            Merge(a,b);
            s[b] ++ ;
            flag[a] = 1, flag[b] = 1;
            scanf("%d%d",&a,&b);
        }
        for(i = 0;i < MAXN; i++)
        {
        	if(flag[i] && s[i]>1)
        	{
        		FLAG = 1;
        	}
        }
        if(FLAG == 1)
            printf("Case %d is not a tree.\n",con++);
        else
        {
            int sum = 0;
            for(i = 0; i < MAXN; i++)
            {
                if(flag[i] && father[i] == i)
                    sum++;
            }
            if(sum == 1)
               	printf("Case %d is a tree.\n",con++);
            else
              	printf("Case %d is not a tree.\n",con++);
        }
    }
    return 0;
}