Is It A Tree?
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 32027 | Accepted: 10869 |
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.
题目大意:
输入一对一对的数字作为树的其中一个父子结点,第一个数为父节点,第二个数为子节点,0 0表示一组数据已经输入完毕,-1 -1表示输入结束。问每一组数据是否是一棵树。
普通的并查集问题。
要点:
1、空树是一棵树 如 0 0
2、作为子结点,不能有其他的父节点,否则不是一棵树。如 1 2 3 2 0 0
3、不能形成环,否则不是一棵树,如 1 2 2 3 3 1 0 0
4、不能是森林,森林不能作为一棵树,如1 2 2 3 4 5 0 0
代码如下:
#include <cstdio>
#include <vector>
#include<map>
#include<set>
using namespace std;
map<int ,int> mp; //用map记录父节点
set<int> s; //用set记录结点个数
int father(int a)
{
if(mp.find(a)==mp.end())
return a;
else
mp[a]=father(mp[a]);
return mp[a];
}
int main()
{
int a,b;
int num=1,n=0;
int flag=1;
while(scanf("%d %d",&a,&b)&&(a!=-1||b!=-1))
{
if(a!=0||b!=0)
{
if(flag)
{
n++; //用n记录树枝个数
s.insert(a);
s.insert(b);
if(b!=father(b)) //判断子节点是否有其他父节点
flag=0;
else
{
if(father(a)==father(b)) //判断是否形成环
flag=0;
else
{
mp[b]=a;
}
}
}
}
else
{
if(flag&&n!=0)
{
if(n+1!=s.size()) //如果树枝个数+1不等于结点个数,则为森林
flag=0;
}
if(flag)
printf("Case %d is a tree.\n",num++);
else printf("Case %d is not a tree.\n",num++);
mp.clear();
s.clear();
flag=1;
n=0;
}
}
}