Hiho----无间道之并查集

 1 import java.util.Scanner;
 2 
 3 
 4 
 5 
 6 public class Main {
 7     public static int c=0;
 8     public static int[] e = new int[100100];
 9     public static int[][] j= new int[100100][52];
10     public static int d=0;
11     public static int add(){
12         c++;        
13         return c;
14     }
15     public static int find(char[] k,int[][] j){
16         int p=0,t;
17         for(int i=0; i<k.length; i++){
18             t=k[i]>‘Z‘?k[i]-‘a‘+26:k[i]-‘A‘;
19             if(j[p][t]==0)j[p][t]=add();
20             p=j[p][t];
21             
22         }
23         if(e[p]==0){
24             e[p]=++d;
25             return e[p];
26         }
27         else
28             return e[p];    
29     }
30     public static void main(String[] argv){
31         int [] x = new int [10010];
32         Scanner in = new Scanner(System.in);
33         int num =Integer.parseInt(in.nextLine());
34         int max=0;
35         String out ="";
36         for(int i=0; i<num; i++){
37             String[] s = in.nextLine().split(" ");
38             int o = Integer.parseInt(s[0]);
39             int A = find(s[1].toCharArray(), j);
40             int B = find(s[2].toCharArray(), j);    
41             if(A>max)
42                 max=A;
43             if(B>max)
44                 max=B;
45             int min = A<B? A:B;
46 
47             if(o==0)
48             {
49                 if(x[A]==0&&x[B]==0)
50                     {
51                      x[A]=min; x[B]=min;                
52                     }
53                 else{
54                     if(x[A]!=0&&x[B]!=0){
55                         min=x[A]<x[B]? x[A]:x[B];
56                         int tmp=x[A]+x[B]-min;
57                         for(int w=1; w<=max; w++){
58                             if(x[w]==tmp)
59                                 x[w]=min;
60                         }
61                     }
62                     else{
63                         if(x[A]==0)
64                             x[A]=x[B];
65                         else
66                             x[B]=x[A];
67                     }
68                 }
69             }
70             if(o==1){
71                 if(x[A]==x[B]){
72                     if(x[A]==0)
73                         out=out+"no ";
74                     else
75                         out=out+"yes ";
76                 }        
77                 else
78                     out=out+"no ";
79             }
80             
81         }
82         in.close();
83         out=out+"end";
84         String[] OUT = out.split(" ");
85         for(int t=0; t<OUT.length-1; t++){    
86             System.out.println(OUT[t]);
87         }
88     
89     }
90 
91 }

 1 #include <cstdio>
 2 #include <cstring>
 3 const int N=100010;
 4 #define C(c) c>‘Z‘?c-‘a‘+26:c-‘A‘
 5 int e[N],x[N][26*2],c=0,d=0;
 6 int add(){
 7     ++c;
 8     e[c]=0;
 9     memset(x[c],0,sizeof(x[c]));
10     return c;
11 }
12 int find(char*s){
13     int p=0,t;
14     while(*s){
15         t=C(*s);
16         if(!x[p][t])x[p][t]=add();
17         p=x[p][t];
18         ++s;
19     }
20     return e[p]?e[p]:e[p]=++d;
21 }
22 char a[100],b[100];
23 int r[N],n,o,A,B;
24 int find(int i){return i==r[i]?i:r[i]=find(r[i]);}
25 int main(){
26     for(scanf("%d",&n);n--;){
27         scanf("%d%s%s",&o,a,b);
28         A=find(a);B=find(b);
29         if(!r[A])r[A]=A;
30         if(!r[B])r[B]=B;
31         A=find(A);B=find(B);
32         if(o)puts(A==B?"yes":"no");
33         else r[A]=B;
34     }
35     return 0;
36 }