Is It A Tree?
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14482 Accepted Submission(s): 3222
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.
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.
/*
1. 肯定满足只有一个树根
2. 一个点不会被指向两次或两次以上。
3. 不能出现环
每一个节点的入度小于等于1,
用ru,表示此处的入度,当入度为2的时候,不是树;
因为每个节点的入度 <=1 ,顶点数目 = 边的数目+ 1
*/
#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
#define MAX 20001
int dian[MAX],ru[MAX];
int main(){
int i,j,a,b,cas,biannum,diannum,f;
// freopen("test.txt","r",stdin);
cas=1;
while(scanf("%d%d",&a,&b))
{
if(a<0&&b<0) break;
f=0;
biannum=0;
diannum=0;
memset(ru,0,sizeof(ru));
memset(dian,0,sizeof(dian));
while(a||b)
{
biannum++;
if(!f)
{
if(ru[b]!=0)
f=1;
ru[b]++;
if(dian[a]==0)
{
dian[a]=1;
diannum++;
}
if(dian[b]==0)
{
dian[b]=1;
diannum++;
}
}
scanf("%d%d",&a,&b);
}
if(diannum==0) diannum=1;
printf("Case %d ",cas++);
if(!f&&diannum==biannum+1)
printf("is a tree.\n");
else
printf("is not a tree.\n");
}
return 0;
}