POJ-1308 Is It A Tree?
2016-02-15 17:43
369 查看
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.
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
Sample Output
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 27435 | Accepted: 9356 |
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 4 5 6 0 0 8 1 7 3 6 2 8 9 7 5 7 4 7 8 7 6 0 0 3 8 6 8 6 4 5 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<cstring> #include<cstdio> #define MAXN 200000 using namespace std; int per[MAXN]; bool flag; int vis[MAXN]; void init() { for(int i=0;i<=MAXN;i++) per[i]=i; } int find(int x) { if(per[x]==x) return x; else return per[x]=find(per[x]); } void join(int x,int y) { int fx=find(x); int fy=find(y); if(fy!=fx){ per[fy]=fx; } else{ flag=false; } } int main() { int a,b,mark=0; while(cin>>a>>b) { if(a==-1&&b==-1) break; mark++; memset(vis,0,sizeof(vis)); if(a==0&&b==0){ printf("Case %d is a tree.\n",mark); continue; } flag=true; init(); vis[a]=1; vis[b]=1; join(a,b); int cut=0; while(cin>>a>>b,a&&b) { vis[a]=1; vis[b]=1; join(a,b); } for(int i=0;i<MAXN;i++){ if(vis[i]==1&&per[i]==i){ cut++; } if(cut>1){ flag=false; break; } } if(flag) printf("Case %d is a tree.\n",mark); else printf("Case %d is not a tree.\n",mark); } return 0; }
相关文章推荐
- iOS支付宝接口调用总结
- MFC ActiveX 控件:添加自定义事件
- GridControlToExcel
- [Codecademy] HTML&CSS 第三课:HTML Basic II
- 只做一件事
- layer是一款近年来备受青睐的web弹层组件
- [bzoj3233] [Ahoi2013]找硬币
- Linux内核编译,模块尺寸变大的解决办法
- 什么是 MIME TYPE?
- 使用hbase版本异常
- android.support.design
- 我在Mac OS X 操作系统上搭建Android开发环境的经历
- 如何查看80端口被占用
- ASP.NET MVC 实现二级域名
- android 自定义View Caused by: java.lang.ClassNotFoundException: Didn't find class
- JAVA array,map 转 json 字符串
- svn merge和branch
- logistic回归和logic回归
- [Codecademy] HTML&CSS 第二课:Build Your Own Webpage
- 俄罗斯方块系列