Hdu 1325 Is It A tree ?【图论】

Is It A Tree?

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

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 45 6 0 08 1 7 3 6 2 8 9 7 57 4 7 8 7 6 0 03 8 6 8 6 45 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.

 

Source

North Central North America 1997

 

要判断一个节点是否有多个父亲，只需检查一个节点的入度是否大于1即可，另外要注意，检查是否存在入度为零的节点（根节点）是否只有1个，如果有多个则为森林，不满足树的特性、

#include<iostream>#include<cstring>#include<algorithm>#include<iomanip>#include<cmath>using namespace std;const int maxn = 10005;int indeg[maxn],node[maxn];int a,b;int main(){    int Case = 1;    int nodelen = 0;    while(cin>>a>>b&&(a>=0&&b>=0)){        memset(indeg,0,sizeof(indeg));        memset(node,0,sizeof(node));        if(a==0&&b==0){            cout<<"Case "<<Case++<<" is a tree."<<endl;            continue;        }        nodelen=max(a,max(nodelen,b));        indeg[b]++;        node[a]=node[b]=1;        while(cin>>a>>b&&(a||b)){            nodelen=max(a,max(nodelen,b));            indeg[b]++;            node[a]=node[b]=1;        }        int flag = 1;        for(int i=0;i<=nodelen;i++){            if(node[i]&&indeg[i]>1){                flag = 0;                break;            }        }        if(flag){            int treenum = 0;            for(int i=0;i<=nodelen;i++){                if(node[i]&&indeg[i]==0){                    treenum++;                }                if(treenum>1){                    flag = 0;                    break;                }            }        }        if(flag){            cout<<"Case "<<Case++<<" is a tree."<<endl;        }        else{            cout<<"Case "<<Case++<<" is not a tree."<<endl;        }    }    return 0;}