家谱

题面

map+并查集

 1 #include<set>
 2 #include<map>
 3 #include<list>
 4 #include<queue>
 5 #include<stack>
 6 #include<string>
 7 #include<cmath>
 8 #include<ctime>
 9 #include<vector>
10 #include<bitset>
11 #include<memory>
12 #include<utility>
13 #include<cstdio>
14 #include<sstream>
15 #include<iostream>
16 #include<cstdlib>
17 #include<cstring>
18 #include<algorithm>
19 using namespace std;
20 
21 string z,y;
22 map<string,string>p;
23 
24 string find(string x){
25     return x==p[x]?x:p[x]=find(p[x]);
26 }
27 
28 int main(){
29     char zy;
30     cin>>zy;
31     while(zy!='$'){
32         cin>>z;
33         if(zy=='#'){
34             y=z;
35             if(p[z]=="") p[z]=z;
36         }
37         else if(zy=='+'){
38             p[z]=y;
39         }
40         else{
41             cout<<z<<' '<<find(z)<<endl;
42         }
43         cin>>zy;
44     }
45     return 0;
46 }

 

转载于:https://www.cnblogs.com/ainiyuling/p/11137015.html