POJ1308 是不是树

最新推荐文章于 2022-02-15 15:15:00 发布

wjh461237781

最新推荐文章于 2022-02-15 15:15:00 发布

阅读量337

点赞数

分类专栏： poj 文章标签： poj

本文链接：https://blog.csdn.net/wjh461237781/article/details/37932559

版权

poj 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

Language:

Is It A Tree?

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 21540		Accepted: 7361

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.

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，其他节点的入度为1，根节点只能有一个。空树也是树。代码如下。

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;

int bj[1000000],x[1000000],y[1000000];//bj用来记节点入度
int main()
{
	int t=0,i,j;
	while(1)
	{
		memset(bj,0,sizeof(bj));
		t++;
		int z=0;
		int flag=0;
		while(1)
		{
			cin>>x[z]>>y[z];
			
			if(x[z]==-1&&y[z]==-1)
			{
				flag=1;
				break;
			}
			if(x[z]==0&&y[z]==0)break;
			bj[y[z]]++;z++;
		}
		if(flag)break;
		int g0=-1,flog=0;
		for(i=0;i<z;i++)
		{
			if(bj[x[i]]==0){
				if(g0==-1)
				g0=x[i];
				else if(g0!=x[i])flog=1;
			} 
			if(bj[x[i]]>1){
				flog=1;
				break;
			}
			if(bj[y[i]]>1){
				flog=1;
				break;
			}
		}
		if(z==0)cout<<"Case "<<t<<" is a tree."<<endl;//考虑下空树的情况
		else if(flog||g0==-1)cout<<"Case "<<t<<" is not a tree."<<endl;
		else cout<<"Case "<<t<<" is a tree."<<endl;
	}
	return 0;
}

顺便附上几组测试数据。。。

0 0

1 1 0 0

1 2 1 2 0 0

1 2 2 3 4 5 0 0

1 2 2 3 3 4 4 5 5 6 6 1 0 0

结果

Case 1 is a tree.

Case 2 is not a tree.

Case 3 is not a tree.

Case 4 is not a tree.

Case 5 is not a tree.