|
|
| Показать все ветки Спрятать все ветки Показать все сообщения Спрятать все сообщения | | why its fast | 👑TIMOFEY👑 | 2104. Игра с полоской | 22 ноя 2022 13:00 | 1 | in tree sum of vertex <= n + n/2 + n/4 +... = n*(1 + 1) = 2n | | If WA9 | zwqzwq | 2104. Игра с полоской | 3 сен 2021 17:26 | 1 | If WA9 zwqzwq 3 сен 2021 17:26 Take attention:
No matter whose turn it is,if all the color is A,than Alise win,else Bob win. | | WA8 | Kirill | 2104. Игра с полоской | 2 авг 2021 17:15 | 2 | WA8 Kirill 1 мар 2020 00:05 I have WA8. Who can help with test? Re: WA8 Sergey Kazakov 2 авг 2021 17:15 6 ABAAAA
AAAAAA
--
Alice wins
Edited by author 02.08.2021 17:16 | | How to solve? Problem with T6... | Artyom_Puchkov | 2104. Игра с полоской | 18 май 2020 17:10 | 2 | I solved this problem as follows: each player will try to choose the side that has less chance to win against the other. In my examples, everything works, but when I submit for verification, test 6 fails =(. Please explain how to solve it, I'm a beginner, and very interested in solving this problem. How do you calculate the chances of winning on the chosen side? | | Binary tree | Mahilewets Nikita [BSUIR] | 2104. Игра с полоской | 8 окт 2017 10:10 | 1 | You can build binary tree
Left child corresponds to inward fold
Right child corresponds to outward fold
Root is unfolded strip
Build tree from root to leaves and before going deeper check winning conditions | | C++ TLE hint | Alexey | 2104. Игра с полоской | 8 июн 2017 01:08 | 1 | | | sample output | 140701425 | 2104. Игра с полоской | 20 ноя 2016 13:37 | 1 | Could anyone give me some sample input and output?
Thanks a lot. | | Ошибка в исходном примере? | jazator | 2104. Игра с полоской | 19 ноя 2016 18:16 | 2 | 4
BBAA
BABB
=
Bob
Почему в исходном примере выигрывает Боб? Если при первом сгибе получаем полоску АА, значит должна выиграть Алиса... Почему нет? There is information:"Если после очередного сгиба полоска стала полностью одноцветной".It's mean, both of sides needs to have one color |
|
|
|
