Is It A Tree? (并查集)
来源:互联网 发布:一钻淘宝店铺转让 编辑:程序博客网 时间:2024/05/22 06:27
Is It A Tree?
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25319 Accepted Submission(s): 5788
Problem 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.
Source
North Central North America 1997
并查集的问题
#include<iostream>#include<algorithm>#include<cstdio>#include<string.h>#include<set>using namespace std;const int N=101000;int par[N],ran[N];void init(int n){ for(int i=0;i<=n;i++) { par[i]=i; ran[i]=0; }}int find(int x){ if(par[x]==x) return x; return par[x]=find(par[x]);}set<int>s;void unite(int x,int y){ x=find(x); y=find(y); if(x==y) return ; if(ran[x]<ran[y]) par[x]=y; else { par[y]=x; if(ran[x]==ran[y]) ran[x]++; }}bool same(int x,int y){ return find(x)==find(y); }int n,m;int main(){ int k=1; s.clear(); init(100000); int f=0; while(scanf("%d%d",&n,&m),n>=0||m>=0) { if(n==0&&m==0 ) { if(!f) { int d=0; for(set<int>::iterator it=s.begin(); it!=s.end(); it++) { if(par[*it]==*it) d++; } if(d>1 ) f=1; } if(f) printf("Case %d is not a tree.\n",k++); else printf("Case %d is a tree.\n",k++); s.clear(); init(100000); f=0; continue; } else if(!f) { s.insert(n); s.insert(m); int ax=find(n); int ay=find(m); if(ax==ay) { f=1; } else if(m!=find(m)) { f=1; } else { par[ay]=ax; } } } return 0;}
人一我百!人十我万!永不放弃~~~怀着自信的心,去追逐梦想。
阅读全文
0 0
- 【并查集】Is it a tree?
- 【并查集】Is it A Tree?
- Is It A Tree?(并查集)
- Is It A Tree? (并查集)
- Is It A Tree? 并查集
- Is It A Tree?(并查集)
- Is It A Tree?(并查集)
- hdu 1325 Is It A Tree?(并查集)
- pku 1308 Is It A Tree?(并查集)
- HDU 1325 Is It A Tree? (并查集)
- poj1308 (并查集)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?(并查集)
- win10开机启动设置
- Java常用类及其方法(二)String
- 解决猎豹免费wifi开启不了的问题
- Golang日志库源码分析:Glog
- (Unity优化) 对象池的创建
- Is It A Tree? (并查集)
- Make defensive copies when needed
- 19、二叉树的镜像
- Android中ViewPager常用功能4补充----viewpager图片查看器
- JAVA实现较完善的布隆过滤器
- 欧拉函数
- Thread.join()的使用
- POJ 3167 Layout(差分约束)
- Red Gate系列之一 SQL Compare 10.4.8.87 Edition 数据库比较工具 完全破解+使用教程