这篇博客讨论了一种两个人玩的字符串构造游戏，玩家必须在给定字符串集合的前缀下进行移动。游戏进行多次，最后一局的胜者是总赢家。文章介绍了解决策略，通过构建Trie树并进行DFS来确定先手是否必胜。
B. A Lot of Games
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Andrew, Fedor and Alex are inventive guys. Now they invent the game with strings for two players.
Given a group of n non-empty strings. During the game two players build the word together, initially the word is empty. The players move in turns. On his step player must add a single letter in the end of the word, the resulting word must be prefix of at least one string from the group. A player loses if he cannot move.
Andrew and Alex decided to play this game k times. The player who is the loser of the
最低0.47元/天 解锁文章
扫一扫
939
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
