70分求助

P3367 【模板】并查集

$TLE$ $70$分
by qfpjm @ 2021-03-07 22:16:02


~~神奇的写法~~
by xfrvq @ 2021-03-07 22:18:04


$parent_i$更新时要100000次啊
by xfrvq @ 2021-03-07 22:18:41


1e4再乘上1e5会爆
by xfrvq @ 2021-03-07 22:20:10


union 这个写法太奇怪了,看一下题解吧
by CGDGAD @ 2021-03-07 22:20:27


```cpp void union_(int v1, int v2) { int p1 = find(v1); int p2 = find(v2); if (p1 != p2) { f[v1] = p2; } } ``` 感觉这个才对
by CGDGAD @ 2021-03-07 22:22:05


合并时更新的话应该和暴力差不多
by 可持久化CRTrie @ 2021-03-07 23:24:53


没有体现出并查集的优势
by 可持久化CRTrie @ 2021-03-07 23:29:10


|