POJ 1308 Is It A Tree? 并查集
来源:互联网 发布:手机如何投诉淘宝卖家 编辑:程序博客网 时间:2024/06/03 14:09
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u
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.//思路 没有孤立的节点 没有环就是树#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>using namespace std;const int maxn=99999;int a[maxn];//并查集int rank[maxn];//树高void init(){ for(int i=0;i<maxn;i++)a[i]=i,rank[i]=0;}int find(int x){ if(x==a[x])return x; return a[x]=find(a[x]);}void unit(int x,int y){ x=find(x); y=find(y); if(x==y)return ; if(rank[x]<rank[y]) a[x]=y; else { a[y]=x; if(rank[x]==rank[y])rank[x]++; }}bool same(int x,int y){ return find(x)==find(y);}bool vis[maxn];int main(){ int n,m,i,j,k,t; int x,y;int cas=1; while(true) { init(); int ok=0;//判断是否存在环 memset(vis,false,sizeof(vis)); while(cin>>x>>y) { if(x==-1&&y==-1)return 0; if(!x&&!y)break; vis[x]=vis[y]=true; if(!same(x,y)) unit(x,y); else ok=1; } int sum=0; for(i=1;i<maxn;i++)if(vis[i]) { if(i==a[i])sum++;//判断是否存在孤立的节点 } if(ok||sum>1)printf("Case %d is not a tree.\n",cas++); else printf("Case %d is a tree.\n",cas++); } 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 1308Is It A Tree? 并查集求解
- poj 并查集 - 1308 Is It A Tree?
- POJ - 1308 Is It A Tree?(并查集+dfs)
- poj 1308 Is It A Tree? 数据结构 并查集
- POJ 1308 Is It A Tree?(并查集)
- poj 1308 Is It A Tree?(并查集)
- Android获取LayoutInflater对象的方法总结
- top grade korinplex phenolic film faced formply plywood with full hardwood core
- pyspider的mysql数据存储接口
- Java开发错误笔记(一)
- javascript 判断验证表单值是否有汉字
- POJ 1308 Is It A Tree? 并查集
- JAVA this关键字
- msyql null 引起的错误
- 学习Java如何处理事务
- Linux的Core文件设置与调试
- 经典SQL学习笔记 (五)-创建表、约束、修改表
- TurboPower Async Professional 在Delphi2010及Delphi7中的安装
- The connection to adb is down, and a severe error has occured.问题解决方法
- CUICatalog: Invalid asset name supplied: (null), or invalid scale factor: 2.000000