I was wondering if there is a problem solvable on a 2D grid using square root decomposition :-) or if anyone used it before
I was wondering if there is a problem solvable on a 2D grid using square root decomposition :-) or if anyone used it before
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
Auto comment: topic has been updated by Ahmed_Morsy (previous revision, new revision, compare).
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.