| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Hi, I'm stuck in such a problem who ask's for the given set G of points in a plane, for each point i, how many points s are less than an integer D close to point i.
My fist and naive approach was an O(N^2) solution looking for the distance from all points to points, which didn't got TLE.
What is the better approach ?
Please, give link to problem.
The statement is in portuguese, here it is Link
It turns out that the problem uses Manhattan distance. Take a look at the Pairs problem from http://ioi2007.hsin.hr/tasks/solutions.pdf for the idea of a solution.
thanks, it's exactly what is needed :D
You can use convex hull which garanted O(NlogN) time
what does it give you?
http://rain.ifmo.ru/cat/view.php/theory/math/geometry-2005
Read the problem more carefully. It seems, you misunderstood it.
I'm not asking you for a link. There are a lot of links in the internet. I just asked : "What does it give you?" Please, explain.
Thanks.