| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
Here is the statement https://wcipeg.com/problem/coi08p3
I found it very interesting, because restrictions are big. I was thinking about using array d[i] — number of cells with distance i to them, but I cannot recalculate it for one rectangle quickly.
So if you have any ideas, please share them
Let $$$f_i(t)$$$ be the number of cells covered in the $$$i$$$-th sheet after $$$t$$$ minutes. It's easy to show that we can split the range $$$[0, \infty)$$$ into $$$O(1)$$$ ranges such that in each of these ranges, $$$f_i$$$ is a constant, linear or quadratic polynomial.
What the problem asks is the sum $$$f(t) = \sum_i f_i(t)$$$ for various values of $$$t$$$. Because each $$$f_i$$$ is a piecewise quadratic function with $$$O(1)$$$ pieces, $$$f$$$ is also a piecewise quadratic function with $$$O(n)$$$ pieces. You can calculate the coefficients of the polynomials in each of these pieces (by sweepline, for example) and evaluate a suitable function for each $$$t$$$ in the input.
What would be the formula to calculate covered area for one rectangle? Don’t fully get it
If you have a rectangle formed from $$$(x_1, y_1)$$$ and $$$(x_2, y_2)$$$ (here, I use them as points, not unit cells like in the problem), then the area covered at time $$$t$$$ is