HDU 1325Is It A Tree?
来源:互联网 发布:如何把企业淘宝做好 编辑:程序博客网 时间:2024/05/16 18:37
Is It A Tree?
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription
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<cstring>using namespace std;int fa[100005];int main(){ int a,b,flag,i,j; int t=1; while(1) { j=0; i=0; flag=0; memset(fa,0,sizeof(fa)); while(scanf("%d%d",&a,&b)&&a&&b) { if(a<0||b<0) return 0; if(fa[b]-1==1) flag=1; if(fa[a]==0) j++; if(fa[b]==0) j++; fa[a]=1;fa[b]=2;i++; } if(flag==0&&j==i+1) printf("Case %d is a tree.\n",t++); else printf("Case %d is not a tree.\n",t++); }}
0 0
- HDU 1325 Is It a Tree?
- hdu 1325 Is It A Tree?
- hdu 1325 Is It A Tree?
- hdu 1325 Is It A Tree?
- hdu 1325 Is It A Tree?
- hdu 1325 Is It A Tree?
- hdu 1325 is it a tree?
- HDU-1325-Is It A Tree?
- HDU 1325 Is It A Tree? ---树
- HDU 1325 Is It A Tree?
- hdu 1325 Is It A Tree?
- hdu 1325 Is It A Tree?
- hdu 1325 Is it a tree
- hdu 1325 &&poj1308 Is It A Tree?
- HDU 1325 Is It A Tree?
- HDU 1325 Is It A Tree?
- HDU 1325 Is It A Tree?
- hdu 1325 is it a tree?
- Java 远程调试参数说明
- iOS关于navigationBar的透明,动态缩放,动态隐藏,毛玻璃
- C语言中内存分布及程序运行中(BSS段、数据段、代码段、堆栈)
- IDEA中maven项目创建并使用自己的archetype
- Android webView 缓存 Cache + HTML5离线功能 解决
- HDU 1325Is It A Tree?
- 适配器模式
- 拆解Cluene系列(14)——搜索时序图
- WebView用法详解
- 仿微信-界面动画(8)提示框Click监听
- 【Spark Java API】Transformation(1)—mapPartitions、mapPartitionsWithIndex
- 处理string对象中的字符
- java 中的finalize()
- 在WebView中加载html内容出现乱码