Discussion @ 1167. Bicolored Horses @ Timus Online Judge

Online Judge	Problems	Authors	Online contests
About Online Judge Frequently asked questions Site news Webboard Links	Problem set Submit solution Judge status Guide	Register Update your info Authors ranklist	Current contest Scheduled contests Past contests Rules

Discussion of Problem 1167. Bicolored Horses

Does there exist any O(n^2) solution to this problem?

Posted by sak3t 13 Dec 2017 18:46

I have used O(k*n^2) approach. Please explain O(n^2) approach if it exists.