1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56

#include<stdio.h>
int par[10200];
int cnt[10200];
int city[10200];
int find(int m) {
	if(par[m]==m)
		return m;
	else {
		int t=par[m];
		par[m]=find(par[m]);
		cnt[m]+=cnt[t];
		return par[m];
	}
}
void unite(int x,int y) {
	x=find(x);
	y=find(y);
	if(x!=y) {
		par[x]=y;
		cnt[x]=1;
		city[y]+=city[x];
		city[x]=0;
	}
}
int main() {
	int T,kase=0;
	scanf("%d",&T);
	while(T--) {
		printf("Case %d:\n",++kase);
		int N,Q;
		scanf("%d %d",&N,&Q);
		getchar();
		for(int i=1; i<=N; i++) {
			cnt[i]=0;
			city[i]=1;
			par[i]=i;
		}
		while(Q--) {
			char c;
			scanf("%c",&c);
			if(c=='T') {
				int n,m;
				scanf("%d %d",&n,&m);
				getchar();
				unite(n,m);
			} else {
				int m;
				scanf("%d",&m);
				getchar();
				int t=find(m);
				printf("%d %d %d\n",t,city[t],cnt[m]);
			}
		}
	}
	return 0;
}