Where can I find some theory on 3d Mo's algorithm(like Mo's algorithm, but with updates)?
# | User | Rating |
---|---|---|
1 | tourist | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 164 |
3 | awoo | 163 |
4 | TheScrasse | 157 |
5 | nor | 153 |
6 | maroonrk | 152 |
6 | -is-this-fft- | 152 |
8 | Petr | 145 |
9 | orz | 144 |
9 | pajenegod | 144 |
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}}$$$