I was wondering if there is a problem solvable on a 2D grid using square root decomposition :-) or if anyone used it before
# | User | Rating |
---|---|---|
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 |
# | User | Contrib. |
---|---|---|
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 | 151 |
9 | maroonrk | 151 |
I was wondering if there is a problem solvable on a 2D grid using square root decomposition :-) or if anyone used it before
Name |
---|
Auto comment: topic has been updated by Ahmed_Morsy (previous revision, new revision, compare).
, actually. And this complexity is reached with a quadtree.
Yeah but I was wandering if it could be useful, a friend of mine went to ioi 2013, he met a medalist who solved game using square root decomposition on 2D grid :-) unfortunately, he doesn't know details
It's really similar to basic sqrt decomposition, (we build small squares 1x1, large squares sqrt x sqrt and stripes 1x sqrt and ofc sqrt x 1) Game was solveable with that, but I don't think that for 100 points.. Here's one task from Polish OI, enjoy it :) http://main.edu.pl/en/archive/oi/13/tet
You can try this problem http://www.codechef.com/SEPT14/problems/QRECT.