Where can I find some theory on 3d Mo's algorithm(like Mo's algorithm, but with updates)?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
Where can I find some theory on 3d Mo's algorithm(like Mo's algorithm, but with updates)?
Название |
---|
Auto comment: topic has been translated by ligaydima (original revision, translated revision, compare)
Take a look at this problem and its editorial: https://codeforces.net/contest/940/problem/F
Actual Discussion: https://codeforces.net/blog/entry/44711
Tl;dr version that I understood.
Online Mo's Algorithm : $$$O((N + Q)*N^{\frac{2}{3}})$$$
Method:
Group into contiguous buckets, each of size $$$N^{\frac{2}{3}}$$$.
So number of buckets = $$$N^{\frac{1}{3}}$$$