USACO-Silver-Worm Sort-并查集的应用以及二分优化

一.题面

Farmer John's cows have grown tired of his daily request that they sort themselves before leaving the barn each morning. They have just completed their PhDs in quantum physics, and are ready to speed things up a bit.

This morning, as usual, Farmer John's NN cows (1≤N≤1051≤N≤105), conveniently numbered 1…N1…N, are scattered throughout the barn at NN distinct locations, also numbered 1…N1…N, such that cow ii is at location pipi. But this morning there are also MM wormholes (1≤M≤1051≤M≤105), numbered 1…M1…M, where wormhole ii bidirectionally connects location aiai with location bibi, and has a width wiwi (1≤ai,bi≤N,ai≠bi,1≤wi≤1091≤ai,bi≤N,ai≠bi,1≤wi≤109).

At any point in time, two cows located at opposite ends of a wormhole may choose to simultaneously swap places through the wormhole. The cows must perform such swaps until cow ii is at location ii for 1≤i≤N1≤i≤N.

The cows are not eager to get squished by the wormholes. H