Обсуждение @ 1452. Pascal против C++ @ Timus Online Judge

{AESC USU} Dembel please. Help me!! [3] // Задача 1452. Pascal против C++ 17 янв 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

{AESC USU} Dembel Re: please. Help me!! [2] // Задача 1452. Pascal против C++ 18 янв 2007 15:33

now I got AC!!

Giorgi Saghinadze (Tbilisi SU) Re: please. Help me!! [1] // Задача 1452. Pascal против C++ 4 мар 2007 20:17

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

Kolyanich Re: please. Help me!! // Задача 1452. Pascal против C++ 4 янв 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.

Обсуждение задачи 1452. Pascal против C++