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.
题意:和小希的迷宫那个题基本一样,唯一不同的是这个是有向的,那么可能出现的情况就是某一个不同祖先的点的入度大于1,列如
5 3
5 6
5 2
6 8
6 4
7 2
7和5同时指向2,但是7和5没有共同祖先,这种情况下就需要判断一下入度了,if(f[a] == f[b] || f[b] != b)前面的条件的意思是判断一下合并之前,这两个点是不是同一个爹,如果还没合并,就是同一个爹了,那合并之后肯定成环。后面的条件就是说b点已经连接过了,就不能再连接了,如果再连接就是入度大于1 了。
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int f[100010];
void init()
{
for(int i=1; i<=100000; i++)
{
f[i] = i;
}
}
int getf(int v)
{
if(v == f[v])
return v;
else
{
f[v] = getf(f[v]);
return f[v];
}
}
void Merge(int u,int v)
{
int t1 = getf(u);
int t2 = getf(v);
if(t1!=t2)
{
f[t2] = t1;
}
}
int vis[100010];
int main()
{
int a,b,i;
int flag;
flag = 0;
init();
int count = 0;
int k=0;
memset(vis,0,sizeof(vis));
while(~scanf("%d %d",&a,&b))
{
if(a == -1&&b==-1) break;
if(a!=0&&b!=0)
{
vis[a] = 1,vis[b] = 1;
if(f[a] == f[b] || f[b] != b)
flag = 1;
else
Merge(a,b);
}
if(a == 0&&b == 0)
{
count = 0;
for(i=1;i<=100000;i++)
{
if(f[i] == i&&vis[i] == 1) count++;
}
if(count>1) flag = 1;
if(flag) printf("Case %d is not a tree.\n",++k);
else printf("Case %d is a tree.\n",++k);
init();
flag = 0;
memset(vis,0,sizeof(vis));
}
}
return 0;
}