用并查集判断是否是一棵树(1325)

Is It A Tree?

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 22984    Accepted Submission(s): 5254

Problem Description

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.

 

Input

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.

 

Output

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).

 

Sample Input

  
  

   
   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
  
  

 

Sample Output

  
  

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

这道题和1272有点相似，不过满足树的定义除了无环、仅一个根结点还需要所有结点的入度<=1，注意这一点。WA 2

#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

int pre[100050];
bool vis[100050];

int find(int x)
{
    return pre[x]==x?x:pre[x]=find(pre[x]);
}

bool join(int x,int y)
{
    int fx=find(x);
    int fy=find(y);
    if(y!=fy||fx==fy) return false; //注意y！=fy，很精髓，保证了所有结点入度<=1
    if(fx!=fy) pre[fy]=fx;
    return true;
}

int main()
{
    //freopen("input.txt","r",stdin);
    int a,b,T=1;
    while(scanf("%d%d",&a,&b)==2)
    {
        if(a<0||b<0) break;
        for(int i=1;i<=100000;i++)
            pre[i]=i;
        memset(vis,0,sizeof(vis));
        bool flag=true;

        while(a!=0)
        {
            vis[a]=vis[b]=true;
            if(flag&&join(a,b)==false) flag=false;
            scanf("%d%d",&a,&b);
        }

        int cnt=0;
        for(int i=1;i<=100000;i++)
            if(vis[i]&&pre[i]==i) cnt++;
        if(cnt>1) flag=false;

        if(flag) printf("Case %d is a tree.\n",T);
        else printf("Case %d is not a tree.\n",T);

        T++;
    }
    return 0;
}