Is it a tree?(和上一道小希的迷宫相同)
2017-09-10 15:35
183 查看
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.
Code
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.
Code
#include <cstdio> #include <iostream> #include <algorithm> #include <cstring> using namespace std; const int maxn = 100010; int pic[maxn]; bool mark[maxn]; int MAX = 100010,MIN = -1; int find(int p){ if(p == pic[p]){ return p; } return find(pic[p]); } void init(){ for(int i = 0; i < maxn; ++i){ pic[i] = i; } memset(mark, false, sizeof(mark)); } void MaxMin(int a, int b){ MAX = max(a, MAX); MAX = max(b, MAX); MIN = min(a, MIN); MIN = min(b, MIN); } int main(){ int a,b; int kase = 1; while(scanf("%d", &a) == 1 && a != -1){ bool flag=true, flag2 = true, flag3 = true; init(); while(scanf("%d", &b)==1 && b != 0){ flag3 = false; if(flag2){ MAX=a; MIN=b; flag2 = false; } MaxMin(a,b); mark[a] = true; mark[b] = true; a = find(a); b = find(b); if(a == b){ flag = false; }else{ pic[a] = b; } scanf("%d", &a); } printf("Case %d ", kase); kase ++ ; int cnt=0; if(flag3 && a == 0 && b == 0){ printf("is a tree.\n"); }else if(flag){ for(int i = MIN; i <= MAX; ++i){ if(mark[i] && pic[i] == i) { cnt++; } } if(cnt == 1){ printf("is a tree.\n"); }else{ printf("is not a tree.\n"); } }else{ printf("is not a tree.\n"); } } return 0; }
相关文章推荐
- 并查集的反思-----小希的迷宫与Is It a Tree?
- HDU 1272 小希的迷宫 + 1325 Is It A Tree? , 并查集
- 并查集之判断图是否成环—小希的迷宫and is it a tree
- hdoj_1232畅通工程 && hdoj_1272小希的迷宫 && hdoj_1213How Many Tables && Is It A Tree?
- hdoj_1232畅通工程 && hdoj_1272小希的迷宫 && hdoj_1213How Many Tables && Is It A Tree?
- HDU 1272小希的迷宫 1325Is It A Tree? 并查集确定图为树
- poj 1308 is it a tree?(图的性质||基础并查集) (同hdu 1272 小希的迷宫 )
- [tree]hdu 1272 小希的迷宫
- 杭电 hdu 1272 小希的迷宫 和 hdu 1325 Is It A Tree?(最下生成树 + 并查集)
- HDU1272&&POJ1308 小希的迷宫&&Is It A Tree?(并查集)
- HDOJ 1272 小希的迷宫(并查集)
- HDU1325||HDU1272(小希的迷宫)
- 小希的迷宫
- 小希的迷宫 HDU - 1272
- HDU 1272 小希的迷宫 并查集 (判断任意2个点是否有且仅有一条路径可以相通)
- hdu 1272小希的迷宫(并查集判断无向图回路)
- hdu1272 小希的迷宫
- HDU 1272 小希的迷宫(并查集判断有无成环)
- HDU 1272 小希的迷宫
- hdu1272 小希的迷宫