CSP式并查集是$O(n)$的
by Lstdo @ 2019-11-08 11:12:09
CSP式并查集还行
by LanrTabe @ 2019-11-08 11:12:34
并查集加上路径压缩就过了
```cpp
return o==fa[o]?o:fa[o]=find(fa[o]);
```
by Xerxes @ 2019-11-08 11:12:41
原来数据这么水吗，怪不得普及（
by LanrTabe @ 2019-11-08 11:13:19
@[WYCTSTF](/user/131273) 没有路径压缩或按秩合并的并查集单次操作可达$O(n)$，加了路径压缩才能达到$O(\log n)$，如果要更快的话两者都要用
by LCuter @ 2019-11-08 11:13:24
CSP式并查集哈哈哈
by 超级小周 @ 2019-11-08 11:13:49
CSP式并查集可海星
by Purple_sword @ 2019-11-08 11:16:35
~~我感觉他在玩梗~~
by XY_cpp @ 2019-11-08 11:19:33
感谢楼上各位大佬，我被初赛搞蒙了
by FallacyMaker @ 2019-11-08 11:19:57
初赛并查集哈哈哈
by autoint @ 2019-11-08 11:23:46