Discussion @ 1775. Space Bowling @ Timus Online Judge

olpetOdessaONU [1 2/3] Is there a faster algorithm? [2] // Problem 1775. Space Bowling 17 Oct 2010 12:05

I wrote a solution with complexity of O(n^3 log n) and got AC for 0.75 sec. Is there a solution for O(n^3) or O(n^2 log n)?

Aleksandar Ivanovic Re: Is there a faster algorithm? [1] // Problem 1775. Space Bowling 6 Apr 2011 01:46

I have O ( N ^ 3 * LogN )and got AC for 0.234s, you can just optimize it. I can't think of a solution with better complexity.

Steven Oldrich Re: Is there a faster algorithm? // Problem 1775. Space Bowling 6 Apr 2011 06:53

Have u used stabbing line problem variation?
What algo have u used to solve this problem

Discussion of Problem 1775. Space Bowling