Is It A Tree? -- HDOJ
来源:互联网 发布:青岛华为软件开发 编辑:程序博客网 时间:2024/05/17 07:06
Is It A Tree?
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1244 Accepted Submission(s): 391
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.
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.
Source
North Central North America 1997
Recommend
Ignatius.L
/* 结束条件判断成了两个-1,,结果一直超时。。。 判断是树的条件: 根节点只有一个 除根节点外,所有节点的入度为1*/#include<iostream>#include<stdio.h>#include<algorithm>#include<string>#include<string.h>#include<math.h>#include<set>using namespace std;int fa[10005];int main(void){ // freopen("in.txt","r",stdin); int u,v,num=1,flg; while(scanf("%d %d",&u,&v)) { if(u<0 && v<0) break;//结束条件为两个负数, if(!u && !v) { printf("Case %d is ",num++); printf("a tree.\n"); continue; } int ru[10001],chu[10001]; memset(ru,0,sizeof(ru)); memset(chu,0,sizeof(chu)); chu[u]++,ru[v]++; flg = true; set<int >st; st.insert(u); st.insert(v); while(scanf("%d %d",&u,&v)) { if(!u && !v) break; chu[u]++,ru[v]++; st.insert(u); st.insert(v); if(flg && ru[v] > 1)//入度大于1 flg = false; } if(flg) { int cnt = 0; set<int > :: iterator iter = st.begin(); while(iter != st.end()) { if(ru[*iter] == 0) cnt++; if(cnt > 1)//多于一个根节点 { flg = false; break; } iter++; } if(cnt == 0) flg = false;//根节点为零 } printf("Case %d is ",num++); if(flg) printf("a tree.\n"); else printf("not a tree.\n"); } return 0;}
- Is It A Tree? -- HDOJ
- hdoj 1325 Is It A Tree?
- HDOJ 1308.Is It A Tree?
- HDOJ 1325 Is It A Tree?
- HDOJ 1325 Is It A Tree?
- HDOJ 1325 Is It A Tree?
- hdoj 1325 Is It A Tree?
- HDOJ 1325 Is It A Tree? 杭电 ACM
- POJ-1308 & HDOJ-1325 Is It A Tree? 解题报告
- hdoj 1325 Is It A Tree? 【并查集】
- HDOJ 1325 Is It A Tree?(并查集)
- 并查集判树 hdoj 1325 Is it a tree?
- HDOJ 1325 Is It A Tree? (并查集)
- HDOJ 1325 Is It A Tree(并查集)
- Is It A Tree?
- Is it a tree?
- Is It A Tree?
- Is It A Tree?
- java虚拟机运行时数据区域
- IPC详解
- 【Android_View】ImageView源码简析笔记(五)
- js 遇到的坑clear
- 【JAVA】数据交换,java方法参数
- Is It A Tree? -- HDOJ
- sum-root-to-leaf-numbers
- mysql
- win10装ubuntu双系统启动时卡在命令行
- css实现鼠标悬停图片放大显示
- 由日期转换成星期几
- Yii2 Layout 传值实现和原理
- c语言typedef的用法
- 卫星热分析-论文有感