USACO 2021 February Contest, Platinum Problem 2. Minimizing Edges
USACO 2021 February Contest, Platinum Problem 2. Minimizing Edges Bessie has a connected, undirected graph GG with NN vertices labeled 1…N1…N and MM edges (2≤N≤105,N−1≤M≤N2+N22≤N≤105,N−1≤M≤N2+N2). ...