Hello all!
Thank you for participating in CodeNite 2021 round-2, hope you all had fun! We will release the results and the editorials in the coming week, and prize-winners will be contacted. Meanwhile feel free to discuss problems and ask doubts in this thread!
Regards, CodeClub, IIT Kharagpur
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 155 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | pajenegod | 145 |
Intended complexity for Queries on Grid? $$$O(Q*sqrt(Q))$$$ or $$$O(Q*log^{2}(nm))$$$
The author's solution has a complexity of O(Q*sqrt(N*M)*log(N))
Just doing as it was said in the statement using segtrees with lazy propagation?
Yeah. Although segment trees will give high constant factor so using root(N*M) fenwick trees with range updates and queries will perform better.
$$$O(N√N\log(n))$$$ Type complexity is very bad for $$$N \simeq 10^5$$$. It is almost same as $$$O(\frac{n^2}{log(n)})$$$.
A Q*sqrt(Q) solution exists as well using prefix xors and square root decomposition. We kept the limits liberal to allow higher complexity solutions as well
just saw the mail in junk T_T
anubhavdhar please provide the link of editorial.