Where can I find some theory on 3d Mo's algorithm(like Mo's algorithm, but with updates)?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 163 |
2 | cry | 161 |
3 | maomao90 | 160 |
4 | -is-this-fft- | 159 |
5 | awoo | 158 |
6 | atcoder_official | 157 |
7 | adamant | 155 |
8 | nor | 154 |
9 | maroonrk | 152 |
10 | Dominater069 | 148 |
Where can I find some theory on 3d Mo's algorithm(like Mo's algorithm, but with updates)?
Name |
---|
Auto comment: topic has been translated by ligaydima (original revision, translated revision, compare)
Take a look at this problem and its editorial: https://codeforces.me/contest/940/problem/F
Actual Discussion: https://codeforces.me/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}}$$$