zoj 3641 Information Sharing

Information Sharing

---

Time Limit: 3 Seconds        Memory Limit: 65536 KB

---

There is going to be a test in the kindergarten. Since the kids would cry if they get a low score in the test, the teacher has already told every kid some information about the test in advance.
But the kids are not satisfied with the information teacher gave. They want to get more. On the testing day, some kids arrived to the classroom early enough, and then shared his/her information with another. kids are honest, if A shares with B, B can get all the information A knows, so does A.
At first the classroom is empty. As time pass by, a kid would arrive, or share information with other. However, the teacher hides somewhere, watching everything. She wants to know how much information some kid has gotten.

Input

There are multiple cases.
The first line of each case contains an integer n, indicating there is n actions.
The following n actions contain 3 types.
1: "arrive Name m a₁ a₂ ..a_m", means the kid called Name arrives at the classroom. He has m information, their id is a₁ a₂ ...a_m.
2: "share Name1 Name2", means that the kids called Name1 and Name2 share their information. (The sharing state will keep on, that means, if A share with B, later B share with C, A can also get all C's information via B. One kid may share with himself, but it doesn't mean anything.)
3: "check Name", means teacher wants to know the number of information kid called Name has got. 

n is less than 100000, and is positive. The information id is among [0,1000000].
Each Name has at most 15 characters.
There would appears at most 1000 distinct information.
Each kid carry no more than 10 information when arriving(10 is included).

Output

For every "check" statement, output a single number. If there's no check statement, don't output anything.

Sample Input

8
arrive FatSheep 3 4 7 5
arrive riversouther 2 4 1
share FatSheep riversouther
check FatSheep
arrive delta 2 10 4
check delta
share delta FatSheep
check riversouther

Sample Output

4
2
5

Hint

check 1: FatSheep has 1 4 5 7, having all the information. So answer is 4.
check 2: delta has only 4 10 , doesn't have 1 5 7. So answer is 2
check 3: riversouther has 1 4 5 7 10, having all the information. So answer is 5

 

分析：赤裸裸的并查集

 

#include<cstdio>
#include<set>
#include<map>
#include<string>
using namespace std;
const int N=100001;
set<int> S[N];
map<string,int> m1;
int p[N];
char op[21],na[21],n2[21];
int find(int x){
	while(p[x]!=x)x=p[x];
	return x;
}
void Union(int x,int y){
	int fx=find(x),fy=find(y);
	if(fx!=fy){
		if(S[fx].size()<S[fy].size()){
			S[p[fx]=fy].insert(S[fx].begin(),S[fx].end());
			S[fx].clear();
		}else{
			S[p[fy]=fx].insert(S[fy].begin(),S[fy].end());
			S[fy].clear();
		}
	}
}
int main(){
	int n,m,i,cnt;
	while(~scanf("%d",&n)){
		for(i=1;i<N;i++)p[i]=i,S[i].clear();
		m1.clear();cnt=0;
		while(n--){
			scanf("%s",op);
			if(op[0]=='a'){
				scanf("%s%d",na,&m);
				m1[na]=++cnt;
				while(m--)scanf("%d",&i),S[cnt].insert(i);
			}else if(op[0]=='s'){
				scanf("%s%s",na,n2);
				Union(m1[na],m1[n2]);
			}else{
				scanf("%s",na);
				printf("%d\n",S[find(m1[na])].size());
			}
		}
	}
	return 0;
}