888g专题

Codeforces 888G. Xor-MST(异或最小生成树)

You are given a complete undirected graph with n vertices. A number a i is assigned to each vertex, and the weight of an edge between vertices i and j is equal to a i xor a j. Calculate the weight of