poj1308 2010.2.8

最新推荐文章于 2018-09-21 22:54:15 发布

Batman_

最新推荐文章于 2018-09-21 22:54:15 发布

阅读量285

点赞数

分类专栏： POJ

本文链接：https://blog.csdn.net/Batman_/article/details/50637825

版权

POJ 专栏收录该内容

61 篇文章 0 订阅

订阅专栏

poj1308 2010.2.8

#include <stdio.h>
#include <string.h>

#define N 100

int hash[N][N],poifa[N],k;
int father,son,num;
int used[N];

int doit();
int find(int);
int match();
int okok();

int okok()
{
	int i,m;
	m=0;
	for(i=1;i<=num;i++)
		if ((used[i])&&(poifa[i]==0)) m++;
	if (m==1) return 1;
	else return 0;
}

int find(int x)
{
	if (poifa[x]==0)
		return x;
	else
		return (poifa[x]=find(poifa[x]));

}

int match()
{
	used[father]=1;
	used[son]=1;
	if (father>num) num=father;
	if (son>num) num=son;
	if (hash[father][son]) return 0;
	if (poifa[son]) return 0;
	hash[father][son]=1;
	hash[son][father]=1;
	if (poifa[father]==son) return 0;
	poifa[son]=find(father);
	return 1;
}
int doit()
{
	if (match())
	{
		while (scanf("%d %d",&father,&son),father)
		{
			if (!match())
				return 0;
		}
		return 1;
	}
	return 0;
}

int main()
{
	k=0;
	int i;
	while (scanf("%d %d",&father,&son),father>=0)
	{
		k++;
		num=0;
		memset(hash,0,sizeof(hash));
		memset(poifa,0,sizeof(poifa));
		memset(used,0,sizeof(used));
		if ((father==0)&&(son==0))
			printf("Case %d is a tree.\n",k);
		else
		{
			if (doit()&&okok())
					printf("Case %d is a tree.\n",k);
				else
				{
					printf("Case %d is not a tree.\n",k);
					if (father)
						while (scanf("%d %d",&father,&son),father);
				}
//			for(i=1;i<=num;i++)
//				printf("%d    %d\n",i,poifa[i]);
		}
	}
	return 0;
}