并查集(3)--POJ 1308 Is It A Tree
来源:互联网 发布:excel数据拆分 编辑:程序博客网 时间:2024/06/17 18:02
Is It A Tree?
http://acm.pku.edu.cn/JudgeOnline/problem?id=1308
Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 9423Accepted: 3219Description
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 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 -1Sample Output
Case 1 is a tree.Case 2 is a tree.Case 3 is not a tree.代码:
C++ CODE :No Title Code 1 2 3 4 5 6 7 8 91011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162 #include<stdio.h>char not,visit[1005];int father[1005];int Find(int i){ while(i!=father[i]) i=father[i]; return i;}void Union(int i,int j){ int r1,r2; r1=Find(i); r2=Find(j); if(r1==r2) { not=1; } else { if(father[j]!=j){not=1;return;} father[j]=i; }}int main(){ int k=1,a,b,i,cnt; while(scanf("%d%d",&a,&b)&&(a>=0&&b>=0)) { not=0;cnt=0; for(i=1;i<=1000;i++) { father[i]=i; visit[i]=0; } while(a||b) { if(a==b)not=1; visit[a]=1; visit[b]=1; if(!not)Union(a,b); scanf("%d%d",&a,&b); } for(i=1;i<=1000;i++) if(visit[i]) { if(father[i]==i) cnt++; if(cnt==2) { not=1; break; } } if(not) printf("Case %d is not a tree.\n",k++); else printf("Case %d is a tree.\n",k++); } return 0;} #include<stdio.h> char not,visit[1005]; int father[1005]; int Find(int i) { while(i!=father[i]) i=father[i]; return i; } void Union(int i,int j) { int r1,r2; r1=Find(i); r2=Find(j); if(r1==r2) { not=1; } else { if(father[j]!=j){not=1;return;} father[j]=i; } } int main() { int k=1,a,b,i,cnt; while(scanf("%d%d",&a,&b)&&(a>=0&&b>=0)) { not=0;cnt=0; for(i=1;i<=1000;i++) { father[i]=i; visit[i]=0; } while(a||b) { if(a==b)not=1; visit[a]=1; visit[b]=1; if(!not)Union(a,b); scanf("%d%d",&a,&b); } for(i=1;i<=1000;i++) if(visit[i]) { if(father[i]==i) cnt++; if(cnt==2) { not=1; break; } } if(not) printf("Case %d is not a tree.\n",k++); else printf("Case %d is a tree.\n",k++); } return 0; } 0 0
- 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 - Is It A Tree?(并查集)
- POJ-1308 并查集-Is It A Tree?
- POJ 1308 Is It A Tree? 并查集
- POJ 1308Is It A Tree? 并查集求解
- 并查集(2)--POJ 1182 食物链
- UML—模板类实现
- 关系型数据库的事务隔离级别
- poi是什么?
- 蓝桥杯 小朋友排队
- 并查集(3)--POJ 1308 Is It A Tree
- Java Web项目如何连接HBase
- CentOS 7系统中安装Eclipse
- 网页自动刷新的实现
- Mysql 免安装版简约配置
- noip2015D1T2信息传递
- 【原创工具】Android逆向注入注册系统
- 【转】并查集(4)--POJ 并查集 题目汇总 ——czyuan原创
- 432. All O`one Data Structure