nyoj129 树的判定 并查集

树的判定

时间限制： 1000 ms  |  内存限制： 65535 KB

难度： 4

描述

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.

输入

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.

The number of test cases will not more than 20,and the number of the node will not exceed 10000.
The inputs will be ended by a pair of -1.

输出

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).

样例输入

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

样例输出

Case 1 is a tree.
Case 2 is a tree.
Case 3 is not a tree.

来源

#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
#define N 10005
int parent[N],in[N];
bool visit[N];

int find(int x)
{
	if(x==parent[x])
	return x;
	else 
	return find(parent[x]);
}

int main()
{
	int i,k=1,a,b,maxn=0;
	
    memset(visit,false,sizeof(visit));
    memset(in,0,sizeof(in));
    
    for(i=0;i<N;i++)
    parent[i]=i;//初始化
    
    int flag=1;
    while(scanf("%d%d",&a,&b)!=EOF)
    {
    	if(a==-1&&b==-1)
		break;
    	if(a==0&&b==0)//所有有向边添加完毕，开始判定
		{
    		int t=0;
    		for(i=0;i<=maxn;i++)
    		{
    			if(visit[i]&&i==parent[i])
				t++; 
			}
			if(t>1)//出现除根节点之外的独立的节点 
			flag=0;
			if(flag)
			printf("Case %d is a tree.\n",k++);
			else
			printf("Case %d is not a tree.\n",k++);
			
			memset(visit,false,sizeof(visit));
            memset(in,0,sizeof(in));
            for(i=0;i<N;i++)
            parent[i]=i;//初始化
            flag=1;
			maxn=0;//进行下一个test 
		}
		else//添加有向边
		{
			maxn=max(maxn,max(a,b));//保存最大点序号，方便后面处理 
			visit[a]=visit[b]=true;
			in[b]++;//b的进度+1
			if(in[b]>1) 
			flag=0;//一个结点的进度只能为1 
			if(!flag) 
			continue;
			//将边添加 
			int x=find(a);
			int y=find(b);
			if(x!=y)
			parent[y]=x;
			else
			flag=0;
		}
	}
	return 0;
}