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.
思路:
- 因为是有向边,在使用并查集的时候,有向边<x, y>记录为p[y] = x,记录y的父节点为x,不过在记录之前判断是否有环。
- 最终只要每个点的根节点为同一个数,且满足点数=边数+1,那么就是一颗有向边构成的树了。
#include<bits/stdc++.h>
using namespace std;
const int maxn=100000 + 10;
int f[maxn];
int flas;
void init_set()
{
for(int i=0; i<=maxn; i++)
{
f[i]=i;
}
}
int find_set(int x)
{
int r=x;
while(r!=f[r])r=f[r];
int i=x;
int j;
while(i!=r)
{
j=f[i];
f[i]=r;
i=j;
}
return r;
}
int main()
{
int a,b;
int l=0;
while(~scanf("%d%d",&a,&b)&&(a+b>=0))
{
set<int>s;
int m=1;
s.insert(a);
s.insert(b);
l++;
if(a==0&&b==0)
{
printf("Case %d is a tree.\n",l);
continue;
}
init_set();
int flas=1;
f[b]=a;
if(a==b)
flas=0;
while(scanf("%d%d",&a,&b)&&(a+b))
{
s.insert(a);
s.insert(b);
m++;
if(find_set(a)==find_set(b))
{
flas=0;
}
f[b]=find_set(a);
}
set<int>::iterator it=s.begin();
int t=find_set(*it);
for(; flas&&it!=s.end(); it++)
{
if(find_set(*it)!=t)
flas=0;
}
if((int)s.size()==m+1&&flas)
{
printf("Case %d is a tree.\n",l);
}
else
{
printf("Case %d is not a tree.\n",l);
}
}
return 0;
}