算法模板——并查集 1

var
i,j,k,l,m,n:longint;
c:array[0..100000] of longint;
function getfat(x:longint):longint;inline;
begin
if c[x]<>x then c[x]:=getfat(c[x]);   //亮点在这里么么哒
exit(c[x]);
end;
begin
readln(n);
for i:=1 to n do c[i]:=i;
while true do
begin
read(i);if (i<1) or (i>2) then halt;
readln(j,k);
case i of
1:c[getfat(j)]:=getfat(k);    //合并
2:if getfat(j)=getfat(k) then writeln('Together!') else writeln('Not together!'); //判断是否已合并
end;
end;
end.