C. Edgy Trees（并查集+数学）

You are given a tree (a connected undirected graph without cycles) of nn vertices. Each of the n−1n−1 edges of the tree is colored in either black or red. You are also given an integer kk. Consider se

>>阅读原文<<