Hdu.1325.Is It A Tree?(并查集）

Is It A Tree?

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16702    Accepted Submission(s): 3761

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.

 

 1 #include
 2 #include<string.h>
 3 const int M = 100000 + 1 ;
 4 int f[M] ;
 5 int path[M] ;
 6 int in[M] ;
 7 bool vis[M] ;
 8 
 9 int Union (int x)
10 {
11     return x == f[x] ? x : f[x] = Union (f[x]) ;
12 }
13 int main ()
14 {
15     freopen ("a.txt" , "r" , stdin ) ;
16     int u , v ;
17     int cas = 1 ;
18     while (~ scanf ("%d%d" , &u , &v)) {
19         if (u < 0 || v < 0) break ;
20         for (int i = 0 ; i < M ; i ++) f[i] = i ;
21         memset (vis , 0 , sizeof(vis));
22         memset (in , 0 , sizeof(in)) ;
23         int tot = 0 ;
24         if (!vis[u]) {
25                 vis[u] = 1 ;
26                 path[tot ++] = u ;
27         }
28         if (!vis[v]) {
29                 vis[v] = 1 ;
30                 path[tot ++] = v ;
31         }
32         in[v] ++ ;
33      //   printf ("%d ----> %d\n" , u , v);
34         int x = Union (u) , y = Union (v) ;
35         f[y] = x ;
36         if (u != 0 && v != 0) {
37         while (1) {
38             scanf ("%d%d" , &u , &v) ;
39         //    printf ("%d ----> %d\n" , u , v);
40             if (u == 0 && v == 0) break ;
41             if (!vis[u]) {
42                 vis[u] = 1 ;
43                 path[tot ++] = u ;
44             }
45             if (!vis[v]) {
46                 vis[v] = 1 ;
47                 path[tot ++] = v ;
48             }
49             in[v] ++ ;
50             int x = Union (u) , y = Union (v) ;
51             f[y] = x ;
52         }
53         for (int i = 0 ; i < tot ; i ++) Union (path[i]) ;
54    //     for (int i = 0 ; i < tot ; i ++) printf ("%d " , path[i]) ; puts ("") ;
55     //    for (int i = 0 ; i < tot ; i ++) printf ("%d " , in[path[i]]); puts ("") ;
56     //    for (int i = 0 ; i < tot ; i ++) printf ("%d " , f[path[i]]) ; puts ("") ;
57         bool flag = 0 ;
58         int cnt = 0 ;
59         int father = f[path[0]] ;
60         for (int i = 1 ; i < tot && !flag; i ++)
61             if (f[path[i]] != father )
62                 flag = 1 ;
63 
64         for (int i = 0 ; i < tot && !flag ; i ++) {
65             if (in[path[i]] > 1) flag = 1 ;
66             if (in[path[i]] == 0) cnt ++ ;
67             if (cnt > 1) flag = 1 ;
68         }
69          if (cnt == 0) flag = 1 ;
70        // printf ("flag = %d\n" , flag );
71         if (flag) printf ("Case %d is not a tree.\n" , cas ++);
72         else    printf ("Case %d is a tree.\n" , cas ++) ;
73         }
74         else printf ("Case %d is a tree.\n" , cas ++) ;
75     }
76     return 0 ;
77 }

View Code

检查入度，和每个结点的祖先。

终于解决了并查集压缩路径的不完全的问题。hahahaha。。。

另外没有结点，也被认为是树。

转载于:https://www.cnblogs.com/get-an-AC-everyday/p/4515121.html