Editorial for CTU Open Contest 2017 - Punching Power


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.
  • Number of minimal erases = minimal match
  • Minimal match can be solved for example by minimum flows
  • Optimal \mathcal O(N \sqrt N) (but worse matching was allowed too)

Comments

There are no comments at the moment.