Where can I find some theory on 3d Mo's algorithm(like Mo's algorithm, but with updates)?
# | User | Rating |
---|---|---|
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 |
# | User | Contrib. |
---|---|---|
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 | BledDest | 145 |
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.com/contest/940/problem/F
Actual Discussion: https://codeforces.com/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}}$$$