| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
Given a set of circles on a Cartesian plane, there are no 2 circles sharing a point. For each circle we want to find the smallest circle that contains it, or report that there is none.
I tried many solutions that works with rectangles, but none can be modified to work with circles. Any suggestions? :(
sweepline by x-coordinate. for each circle you keep the interval of y-coordinate that it covers. since no pair of circles intersects, they only swap their relative position when sorted when either of them leave or enter the sweepline, which you can just remove/add them. thus you can maintain a set/treap of the order of the intervals in $$$O(n*\log_2n)$$$ time.
granted it would not be the most elegant implementation ever, but it *might works.
does it work with every other convex shapes too?
When considering the line x = a, you can split the circles that cross through this line into 2 halves: up and down. So you can sort these semicircles as a bracker sequence. For finding the smallest circle that contains the circle c, you can find the semicircle s greater than or equal to up semicircle of c by lower_bound, the result is s or result of s.