hdu 1325 Is It A Tree?
2017-08-10 10:50
344 查看
Is It A Tree?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25827 Accepted Submission(s): 5894 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 | We have carefully selected several similar problems for you: 1272 1856 1232 1213 1233 题面与小希的迷宫相仿。 这个是带方向的。 所以我们只需要保证 无环 ,入度 除了根节点外全部为 1 根节点为 0 #include<stdio.h> #include<string.h> #include<algorithm> using namespace std; int in[1000003]; int vis[1000003]; int main() { int x,y; int iCase=0; while(scanf("%d%d",&x,&y)&&x>=0&&y>=0) { ++iCase; memset(in,0,sizeof(in)); memset(vis,0,sizeof(vis)); if(x==0&&y==0) { printf("Case %d is a tree.\n",iCase); continue; } in[y]++; int len=1; vis[x]++; vis[y]++; while(scanf("%d%d",&x,&y)&&x>0&&y>0) { in[y]++; len++; vis[x]++; vis[y]++; } int Even=0,Odd=0; int flag=1; for(int i=1; i<=1000000; i++) { if(vis[i]) if(in[i]>1) flag=0; else if(in[i]==0) Even++; } if(Even==1&&flag) printf("Case %d is a tree.\n",iCase); else printf("Case %d is not a tree.\n",iCase); } } /** 0 0 1 1 0 0 1 2 1 2 0 0 1 2 2 3 4 5 0 0 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 1 0 0 1 2 2 1 0 0 **/ |
Is It A Tree?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25827 Accepted Submission(s): 5894 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 | We have carefully selected several similar problems for you: 1272 1856 1232 1213 1233 |
相关文章推荐
- [HDU] 1325 Is It A Tree?
- TOJ 1856 POJ 1308 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 POJ 1308 Is It ATree?(并查集)
- POJ 1308 && 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 ?
- hdu1325 Is It A Tree?(二叉树的判断)
- hdu 1325 Is It A Tree?(并查集全都是坑)
- hdu1325 Is It A Tree? (并查集+森林)
- HDU 1325 Is It A Tree?
- HDU 1325 Is It A Tree 并查集+树的性质
- HDU 1325 Is it a tree ?