2021“MINIEYE杯”中国大学生算法设计超级联赛（1）1009. KD-Graph（并查集）
Problem Description Let’s call a weighted connected undirected graph of n vertices and m edges KD-G ...
花费 35 ms
2021“MINIEYE杯”中国大学生算法设计超级联赛（1）1005. Minimum spanning tree（min25筛）
Problem Description Given n-1 points, numbered from 2 to n, the edge weight between the two points ...