本博客详细介绍了Codeforces Round #260 Div.2 D题目的游戏规则，玩家在一组字符串前缀的基础上轮流添加字母，无法移动的一方输。游戏进行k次，最后的胜者是赢得最后一局的玩家。博主通过使用 Trie 数据结构和树型动态规划分析了游戏策略，并得出结论：如果win[0]为真且lose[0]也为真，那么第一局的玩家可以控制比赛结果；否则，根据k的值判断获胜者。
D. 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 i-th game makes the first move
最低0.47元/天 解锁文章
扫一扫
313
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
