poj Is It A Tree?(并查集)(连通无环图)
来源:互联网 发布:倚天现货指标公式源码 编辑:程序博客网 时间:2024/06/09 18:38
Is It A Tree?
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 45 6 0 08 1 7 3 6 2 8 9 7 57 4 7 8 7 6 0 03 8 6 8 6 45 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.
判断是否成树的条件:
1.只有一个根节点
2.不存在环路
注意:空树也是树
和HDU1272 小希的迷宫 一样0.0
代码:
#include<stdio.h>#include<math.h>#include<string.h>#define maxn 100000+10#define mem(a,b) memset(a,b,sizeof(a))int pre[maxn],vis[maxn];int n,m,flag;void init(){ flag=0; for(int i=1; i<=maxn; i++) pre[i]=i,vis[i]=0;}int Find(int x){ int r=x; while(pre[r]!=r) r=pre[r]; int i=x,j; while(i!=r) { j=pre[i]; pre[i]=r; i=j; } return r;}void join(int x,int y){ int fx=Find(x),fy=Find(y); if(fx!=fy) pre[fx]=fy; else flag=1;}int main(){ int x,y,k=1; while(~scanf("%d%d",&x,&y),x!=-1||y!=-1) { if(!x||!y) { printf("Case %d is a tree.\n",k++); continue; } init(); join(x,y); vis[x]=1,vis[y]=1; int a,b; while(1) { scanf("%d%d",&a,&b); if(!a&&!b) break; join(a,b); vis[a]=1,vis[b]=1; } int cnt=0; for(int i=1; i<=maxn; i++) if(vis[i]&&Find(i)==i) cnt++; if(cnt>1) flag=1; if(flag) printf("Case %d is not a tree.\n",k++); else printf("Case %d is a tree.\n",k++); } return 0;}
1 0
- poj Is It A Tree?(并查集)(连通无环图)
- POJ 1308 Is It A Tree? (并查集)
- poj 1308 Is It A Tree?(并查集)
- poj 1308 Is It A Tree? (并查集)
- poj 1308 Is It A Tree?(并查集)
- POJ 1308 Is It A Tree? (并查集)
- POJ 1308 Is It A Tree?(并查集)
- POJ - 1308 Is It A Tree?(并查集)
- POJ 1308 Is It A Tree?(并查集)
- POJ-1308-Is It A Tree?(并查集)
- poj 1308 Is It A Tree? (并查集)
- POJ 1308-Is It A Tree?(并查集)
- poj 1308 Is It A Tree?(并查集)
- poj 1308 Is It A Tree?(并查集)
- POJ 1308 Is It A Tree?(简单并查集)
- POJ 1308 && HDU 1325 Is It A Tree?(并查集)
- POJ 1308 HDU 1358 Is It A Tree? 并查集 (好多WA点)
- POJ-1308-Is It A Tree?(并查集 判断树)
- Java NIO 系列教程
- Android多张图片选择框架
- Amazon AWS 安装 Python 2.7.13
- 关于使用DFS,BFS的一些思考总结
- Android LogUtils封装
- poj Is It A Tree?(并查集)(连通无环图)
- Android程序员学PHP开发(30)-ThinkPHP5.0(2)命名空间-PhpStorm
- Java基础---二维数组、冒泡排序法
- C#(VS10)调用HALCON12----实现数字识别
- Linux 安装lrzsz
- Leetcode 397
- Android5.0和6.0之后新增的控件说明
- 几种经典的hash算法
- 关于通知Notification