Implemented Verifier in O(n + m (log n + log m))

[MvKaio]

There is now a verifier that counts all crossings efficiently, using a Fenwick Tree. At the end of our solver, we should run this function to verify consistency of the ordering.