| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 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 |
I recently studied this data structure, and resolved some problems, but I would like to solve other, if anyone can give me some problems, I would be grateful.
This are some problems that i solved by kdtree:
City Houses (with manhattan distance)
Counting Points (basic of kdtree)
Elizabeth's Kingdom (some dificult but very nice problem)
It's look like COJ is not accepting submissions :( Could someone help me? I think I got a working solution for the City Houses problem.
because of the covid situation, currently, in Cuba, the universities are close, this will probably take some time before being fixed
Maybe I’m wrong, but as far as I know kd-trees can cave a complexity as bad as $$$O(N)$$$ per query for malicious inputs.
Also, what is the complexity of your solution to the third problem with KD-trees? I am pretty sure that $$$O(N^2)$$$ and even $$$O(N logN)$$$ can be achieved (it seems to me that you only have to count pairs that are neighbouring on the Voronoi diagram).
Pupils should be solving array problems, not kdtree problems.