Discussion @ 1626. Interfering Segment @ 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 1626. Interfering Segment

Complexity(+)

Posted by vav[14] 9 Feb 2009 19:28

Can this problem be solved better than O(N^3)?

Re: Complexity(+)

Posted by [SPbSU ITMO] WiNGeR 13 Feb 2009 22:36

This problem is supposed to be solved in O(n^3) with small constant factor by author

Re: Complexity(+)

Posted by SPb-MaxBuzz 9 Apr 2009 04:52

Actually, O(N^2 log N) of geometry + O(N^3) of bit operations. This may give you an idea of the solution.