Is It A Tree?(并查集)
来源:互联网 发布:Python中eval() 编辑:程序博客网 时间:2024/05/16 11:25
Is It A Tree?
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 26002 Accepted: 8879
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 <cstdio>#include <cstring>#include <cmath>#include <queue>#include <map>#include <algorithm>#define INF 0x3f3f3f3fusing namespace std;typedef unsigned long long LL;const int MAX = 1e5+10;int pre[11000];int a[11000];bool vis[11000];int top;bool flag;int Find(int x){ return pre[x]==-1?x:pre[x]=Find(pre[x]);}void Join(int u,int v){ int Fx=Find(u); int Fy=Find(v); if(Fx!=Fy) { pre[Fx]=Fy; } else { flag=true; }}int main(){ int u,v; int w=1; while(scanf("%d %d",&u,&v)) { if(u==-1&&v==-1) { break; } if(u==0&&v==0)//空树 { printf("Case %d is a tree.\n",w++); continue; } top=0; memset(pre,-1,sizeof(pre)); memset(vis,false,sizeof(vis)); flag=false; if(!vis[u]) { a[top++]=u; vis[u]=true; } if(!vis[v]) { a[top++]=v; vis[v]=true; } Join(u,v); while(scanf("%d %d",&u,&v)&&(u||v)) { if(!vis[u]) { a[top++]=u; vis[u]=true; } if(!vis[v]) { a[top++]=v; vis[v]=true; } Join(u,v); } printf("Case %d ",w++); if(flag) { printf("is not a tree.\n"); } else { int ans=0; for(int i=0;i<top;i++) { if(pre[a[i]]==-1) { ans++; if(ans>1) { break; } } } if(ans==1) { printf("is a tree.\n"); } else { printf("is not a tree.\n"); } } } 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?(并查集)
- 【并查集】hdu 1325 Is It A Tree? 或 poj 1308 Is It A Tree?
- HDU1325 Is It A Tree? + POJ1308 Is It A Tree?【并查集】
- POJ 1308-Is It A Tree 并查集
- HDU 1325 Is It A Tree?(并查集)
- Is It A Tree?(并查集)
- POJ1308--并查集--Is It A Tree?
- POJ 1308 Is It A Tree? (并查集)
- Is It A Tree?--POJ1308--并查集
- hdu 1325 Is It A Tree?(并查集)
- pku 1308 Is It A Tree?(并查集)
- 【图论05】并查集 1003 Is It A Tree?
- Is It A Tree?(hdu132并查集)
- android侧滑菜单-DrawerLayout的基本使用
- poj 2503 哈希 Map 字典树
- 无USB下如何实现PC电脑与手机无线连接
- Codeforces Round #152 (Div. 2) D. Sweets for Everyone!(二分)
- C++编译、链接涉及到的一些基本问题
- Is It A Tree?(并查集)
- MySql:eclipse连接
- git-stash
- C语言中sscanf 的详细用法
- miniwebx 基于webx设计思想的轻量级mvc框架
- android压缩图片的算法
- svn清理失败乱码问题执行语句
- html5图片裁剪控件原型【含缩放,旋转,拖动功能】---1、控件设计
- GrailsDispatcherServlet中的doDispatch方法