ENG  RUSTimus 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
back to board

Discussion of Problem 1775. Space Bowling

Is there a faster algorithm?
Posted by olpetOdessaONU [1 2/3] 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)?
Re: Is there a faster algorithm?
Posted by Aleksandar Ivanovic 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.
Re: Is there a faster algorithm?
Posted by Steven Oldrich 6 Apr 2011 06:53
Have u used stabbing line problem variation?
What algo have u used to solve this problem