poj.1703.Find them, Catch them(并查集）

Find them, Catch them

Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u

Submit  Status Practice POJ 1703

Description

The police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to identify which gang a criminal belongs to. The present question is, given two criminals; do they belong to a same clan? You must give your judgment based on incomplete information. (Since the gangsters are always acting secretly.)   Assume N (N <= 10^5) criminals are currently in Tadu City, numbered from 1 to N. And of course, at least one of them belongs to Gang Dragon, and the same for Gang Snake. You will be given M (M <= 10^5) messages in sequence, which are in the following two kinds:  1. D [a] [b]  where [a] and [b] are the numbers of two criminals, and they belong to different gangs.  2. A [a] [b]  where [a] and [b] are the numbers of two criminals. This requires you to decide whether a and b belong to a same gang. 

Input

The first line of the input contains a single integer T (1 <= T <= 20), the number of test cases. Then T cases follow. Each test case begins with a line with two integers N and M, followed by M lines each containing one message as described above.

Output

For each message "A [a] [b]" in each case, your program should give the judgment based on the information got before. The answers might be one of "In the same gang.", "In different gangs." and "Not sure yet."

Sample Input

1
5 5
A 1 2
D 1 2
A 1 2
D 2 4
A 1 4

Sample Output

Not sure yet.
In different gangs.
In the same gang.

 1 #include<stdio.h>
 2 #include<set>
 3 #include<map>
 4 #include<algorithm>
 5 #include<string.h>
 6 const int M = 1e5 + 10 ;
 7 int T ;
 8 int n , m ;
 9 int f[M] ;
10 int mm[M] ;
11 int Union (int x)
12 {
13     return f[x] == x ? x : f[x] = Union (f[x]) ;
14 }
15 
16 int main ()
17 {
18     //freopen ("a.txt" , "r" , stdin ) ;
19     scanf ("%d" , &T) ;
20     while (T --) {
21         scanf ("%d%d" , &n , &m);
22         memset (mm , 0 , sizeof(mm)) ;
23         for (int i = 0 ; i <= n ; i ++) f[i] = i ;
24         char s[3] ;
25         int _u , _v , u , v ;
26         int x , y ;
27         int _x , _y ;
28         while (m --) {
29             scanf ("%s" , s) ;
30             if (s[0] == 'D') {
31                 scanf ("%d%d" , &u , &v ) ;
32                 if (mm[u] < mm[v]) std::swap (u , v) ;
33                 if (mm[u] && mm[v]) {
34                     _u = mm[u] ; _v = mm[v] ;
35                     x = Union (_u) ; y = Union (v) ;
36                     f[y] = x ;
37                     x = Union (_v) ; y = Union (u) ;
38                     f[y] = x ;
39                 }
40                 else if (mm[u] && mm[v] == 0 ) {
41                     _u = mm[u] ;
42                     x = Union (_u) ; y = Union (v) ;
43                     f[y] = x ;
44                     mm[v] = u ;
45                 }
46                 else if (mm[u] == 0) {
47                     mm[u] = v ;
48                     mm[v] = u ;
49                 }
50             }
51             else if (s[0] == 'A') {
52                 scanf ("%d%d" , &u , &v) ;
53                 if (mm[u] < mm[v]) std::swap (u , v) ;
54                 if ( !mm[u] || !mm[v]) puts ("Not sure yet.") ;
55                 else {
56                     x = Union (u) ; y = Union (v) ;
57                     if (x == y) puts ("In the same gang.") ;
58                     else {
59                             _x = Union (mm[u]) ;
60                             if (_x != y) puts ("Not sure yet.") ;
61                             else puts ("In different gangs.") ;
62                     }
63                 }
64             }
65         }
66     }
67     return 0 ;
68 }

View Code

 

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