# poj1308——Is It A Tree?（判断是否为树）

806人阅读 评论(0)

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.

#include <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cstdio>
#include <set>
#include <cmath>
#include <algorithm>
#define INF 0x3f3f3f3f
#define MAXN 100005
#define Mod 10001
using namespace std;
int f[MAXN],vis[MAXN],edge,v;
bool flag;
int set_find(int a)
{
if(a!=f[a])
{
f[a]=set_find(f[a]);
}
return f[a];
}
void set_join(int a,int b)
{
a=set_find(a);
b=set_find(b);
if(a!=b)
{
f[b]=a;
edge++;
}
else
flag=true;
}
int main()
{
int a,b,cnt=1;
while(~scanf("%d%d",&a,&b))
{
if(a==-1&&b==-1)
break;
if(a==0&&b==0)
{
printf("Case %d is a tree.\n",cnt++);
continue;
}
memset(vis,0,sizeof(vis));
edge=0,v=0;
flag=false;
for(int i=0;i<MAXN;++i)
f[i]=i;
vis[a]=1;
vis[b]=1;
set_join(a,b);
while(~scanf("%d%d",&a,&b))
{
if(a==0&&b==0)
break;
vis[a]=1;
vis[b]=1;
set_join(a,b);
}
for(int i=1;i<MAXN;++i)
if(vis[i])
v++;
if(!flag&&edge+1==v)
printf("Case %d is a tree.\n",cnt++);
else
printf("Case %d is not a tree.\n",cnt++);
}
return 0;
}

0
0

【直播】机器学习&数据挖掘7周实训--韦玮
【套餐】系统集成项目管理工程师顺利通关--徐朋
【直播】3小时掌握Docker最佳实战-徐西宁
【套餐】机器学习系列套餐（算法+实战）--唐宇迪
【直播】计算机视觉原理及实战--屈教授
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之矩阵--黄博士
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之凸优化--马博士
【套餐】Javascript 设计模式实战--曾亮

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：319288次
• 积分：10226
• 等级：
• 排名：第1636名
• 原创：676篇
• 转载：2篇
• 译文：0篇
• 评论：116条
博主信箱
相关链接
博客专栏
 POJ题目小练 文章：100篇 阅读：51539
文章分类
评论排行
最新评论