hdu 1325 Is It A Tree?
2016-05-14 11:16
363 查看
Is It A Tree?
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 20416 Accepted Submission(s): 4628[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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).
[align=left]Sample Input[/align]
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
[align=left]Sample Output[/align]
Case 1 is a tree.
Case 2 is a tree.
Case 3 is not a tree.
相关文章推荐
- Lua:元表(metatable)与元方法(meatmethod)
- Java Web中如何访问数据库
- windows下 php、apache 版本选择 解惑说明
- Activity中获取view的高度和宽度为0的原因以及解决方案
- HDU 1198 Farm Irrigation (并查集)
- 结构体的学习
- shell(二)Bash常用快捷键
- hdu 3746 Cyclic Nacklace(kmp)
- Spring MVC静态资源处理<mvc:resources><mvc:default-servlet-handler>
- SDAU 练习三 1007 天上掉馅饼问题
- 各分辨率图片生成神器
- 软考二进宫-总结知识点2
- hdu 1213 How Many Tables
- ElasticSearch 攻略(一)
- 2016“百度之星”-测试赛
- getBackground().setAlpha所导致问题
- Beaver's Calculator 【归并排序+贪心】
- 手机开发实战17——CSD与GPRS的比较
- ArrayList源码分析
- 数据库中间件的收集