并查集模式

打砖块

Bricks Falling When Hit challenges your ability to simulate brick falls after sequential erasures using Union Find.

按字典序排列最小的等效字符串

Determine the lexicographically smallest string by modeling character equivalences with union find efficiently.

找到最小生成树里的关键边和伪关键边

Identify critical and pseudo-critical edges in a weighted graph's minimum spanning tree using Union Find efficiently.

保证图可完全遍历

Maximize the number of edges that can be removed while keeping the graph fully traversable for both Alice and Bob.

连接所有点的最小费用

Min Cost to Connect All Points asks for the minimum cost to connect all points on a 2D plane, using manhattan distances …

矩阵转换后的排名

Compute a unique rank matrix using graph indegree with topological ordering, ensuring each element reflects its relative…

处理含限制条件的好友请求

Determine which friend requests can be accepted without violating direct or indirect restrictions using union-find logic…

字符串分组

Group words into connected sets using operations on characters with string and bit manipulation techniques.

删除操作后的最大子段和

Calculate the maximum segment sum after sequential removals using array plus union find for efficient merging of segment…

交换得到字典序最小的数组

Solve the problem of making an array lexicographically smallest through element swaps under a limit constraint.

带权图里旅途的最小代价

Find the minimum cost walk in a weighted graph using array and bit manipulation techniques for efficient path calculatio…