I was wondering if there is a problem solvable on a 2D grid using square root decomposition :-) or if anyone used it before
→ Обратите внимание
До соревнования
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
38:37:48
Зарегистрироваться »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
38:37:48
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 22.11.2024 02:57:12 (l2).
Десктопная версия, переключиться на мобильную.
При поддержке
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.