Is there a faster algorithm?

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?

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?

Have u used stabbing line problem variation?

What algo have u used to solve this problem