并查集题目,有两个小细节
- type2的时候输入的x和y的一样的,那么就是知道了某个数的2倍,所以可以当作type1的情况来求解
- type2输入的x和y来自同一个并查集,那么就不要mix他们,不然qua(并查集中元素的数量)会出错。
/*
* @Description:
* @Autor: Kadia
* @Date: 2020-07-19 19:43:47
* @LastEditors: Kadia
* @Connect: vx:ccz1354 qq:544692713
* @LastEditTime: 2020-07-19 21:50:45
*/
#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
using namespace std;
int par[1000005];
int qua[1000005];
int vis[1000005];
int findroot(int x)
{
if(par[x]==x)
return x;
else
return par[x]=findroot(par[x]);
}
void mix(int x,int y)
{
if(findroot(x)==findroot(y))
return ;
if(vis[findroot(x)]||vis[findroot(y)])
vis[findroot(x)]=vis[findroot(y)]=1;
qua[findroot(y)]+=qua[findroot(x)];
par[findroot(x)]=findroot(y);
}
int same(int x,int y)
{
return findroot(x)==findroot(y);
}
int main()
{
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
qua[i]=1;
par[i]=i;
vis[i]=0;
}
int op;
int cnt=0;
for(int i=1;i<=m;i++)
{
scanf("%d",&op);
if(op==1)
{
int x;
scanf("%d",&x);
if(!vis[findroot(x)])
{
cnt+=qua[findroot(x)];
vis[findroot(x)]=1;
}
}
else
{
int a,b;
scanf("%d%d",&a,&b);
if(a==b)
{
int x=a;
if(!vis[findroot(x)])
{
cnt+=qua[findroot(x)];
vis[findroot(x)]=1;
}
}
else
{
if(vis[findroot(a)]!=vis[findroot(b)])
cnt+=(vis[findroot(a)]==0?qua[findroot(a)]:qua[findroot(b)]);
mix(a,b);
}
}
printf("%d\n",cnt);
}
return 0;
}