Editorial for Another Contest 8 Problem 6 - Unnecessary Forced Reverse Trash Finesse
Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.
Submitting an official solution before solving the problem yourself is a bannable offence.
This is a matching problem - you can have a candidate match of every pusheen with a negative x-coordinate to every pusheen with a positive x-coordinate, and then you wish to minimize the cost of this matching. The graph is bipartite, so this is solvable in .
Comments