Is It A Tree?
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 21982 Accepted Submission(s): 4963
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.
Source
题意 就是判断是否是一个树 要满足3个条件
1、只有一个根节点,由于是有向图,根节点没有一个箭头指向它
2、没有环
3、根节点到达每一个子节点有且只有一条路径
1、只有一个根节点,由于是有向图,根节点没有一个箭头指向它
2、没有环
3、根节点到达每一个子节点有且只有一条路径
#include<cstdio>
#include<cstring>
int pre[10000];
int vis[10000];
void count()
{
for(int i=1;i<10000;++i)
{
pre[i]=i;
vis[i]=0;
}
}
int find(int x)
{
while(pre[x]!=x)
x=pre[x];
return x;
}
int main()
{
int n,m,k=1;
while(scanf("%d%d",&n,&m)!=EOF&&n>0||m>0)
{
count();
pre[m]=n;
vis[m]=1;vis[n]=1;//标记
int a,b,flag=0;
while(scanf("%d%d",&a,&b)!=EOF&&a!=0||b!=0)
{
vis[a]=1;vis[b]=1;
if(pre[b]!=b)//保证每个孩子只有一个父节点(2个父节点肯定不行)
flag=1;
else
pre[b]=a;
}
if(flag)
printf("Case %d is not a tree.\n",k++);
else
{
int sum=0;
for(int i=1;i<10000;++i)
{
if(vis[i]&&pre[i]==i)//判断有几个根节点
{
++sum;
if(sum>1)
break;
}
}
if(sum==1)
printf("Case %d is a tree.\n",k++);
else
printf("Case %d is not a tree.\n",k++);
}
}
return 0;
}