scanf("%d",&z,&x,&y);
by JK_LOVER @ 2020-08-19 13:59:16
int find(int x){
if(fa[x]!=x) fa[x]=find(fa[x]);
return fa[x];
}
要路径压缩，是
int find(int x){
if(fa[x]!=x) return fa[x]=find(fa[x]);
return fa[x];
}
by 向晚 @ 2020-08-19 13:59:56
@[JK_LOVER](/user/227824) 过了，蟹蟹（日常眼瞎
by xdedmws @ 2020-08-19 14:00:46
@[学渣想成犇犇](/user/170410) 这不一样？
by JK_LOVER @ 2020-08-19 14:01:18
@[学渣想成犇犇](/user/170410) OK，咱去优化
by xdedmws @ 2020-08-19 14:01:21
@[JK_LOVER](/user/227824) 会快一点 反正我打的有路径压缩
by 向晚 @ 2020-08-19 14:03:10
@[学渣想成犇犇](/user/170410) 楼主已经路径压缩了……
by QwQcOrZ @ 2020-08-19 14:04:52
@[学渣想成犇犇](/user/170410) 看来是我要重新学习路径压缩了/kk/kel
by JK_LOVER @ 2020-08-19 14:05:16
@[QwQcOrZ](/user/61120) 噢 好吧 是我错了
by 向晚 @ 2020-08-19 14:06:29