OJ Board

how to compare all pairs faster than O(n^2) it gives TLE of course My algo is here. 1) Sort data in ascending order based on x coordinates. 2) Set default minimum distance d(d is distance between point1 and point2. 3) Restrict the x-range with d. 4) Copy 1) between x-range of 3). 5) --Sort 4) in as...

People, perhaps this may be the most useful tip on getting your 10310 program to AC. First of all, you can use doubles (no need to use long long and multiply input by 1000 blahblah). Secondly, when the dog & gopher reach the hole at same time, it's still considered a successful escape. Lastly, ...

You telling me you can find nearest F(N) = N^2 with O(1)?

Hmmm, I'm not sure the exact worst time is but i think it's greater than O(1), since it's from zero to the next F(N).

please point out my mistake if i'm wrong about the run time or there's better solution.



ZW