Discussion @ 1452. Pascal vs. C++ @ Timus Online Judge

please. Help me!!

Posted by {AESC USU} Dembel 17 Jan 2007 20:23

I have TLE#12 on C++ and TLE#10 on Pascal but my solution O(N^2*logN)
Please help me.give me any test with TLE.

Edited by author 11.03.2007 11:45

Re: please. Help me!!

Posted by {AESC USU} Dembel 18 Jan 2007 15:33

now I got AC!!

Re: please. Help me!!

I have the same problem. TLE.
can anybody explain my O(N^2) algo?
gsaghinadze@yahoo.com

Re: please. Help me!!

Posted by Kolyanich 4 Jan 2011 21:48

near O(N^2) algo is with use of hashing to avoid binary search. I'd used standard .net Dictionary<int, int> class for this, and got AC.

Discussion of Problem 1452. Pascal vs. C++