Блог пользователя accidentallygivenfuck

USACO 2012 January: Cow Run
Автор accidentallygivenfuck, история, 9 лет назад, По-английски

Hello,

I am having hard time in understanding the statement of problem Cow Run, USACO 2012 January Contest. I can't understand what the problem statement asks for.

At first, I thought problem was about finding a sequence of moves that, no matter how Bessie moves, guarantees that cows will end the run at a position no more than K units distance away from the initial position.

But, then, why are Bessie's moves provided?

I would appreciate any help.
Thanks.

  • Проголосовать: нравится
  • +4
  • Проголосовать: не нравится

»
9 лет назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

Can anyone help?

→ Ответить
»
9 лет назад, # |
← Rev. 2   Проголосовать: нравится +5 Проголосовать: не нравится

You wrote

finding a sequence of moves that, no matter how Bessie moves, guarantees that cows will end the run at a position no more than K units distance away from the initial position.

but I think it's more like a two-player game -- FJ makes a move, then Bessie reacts to his move, then he reacts to her move, etc. You want to find moves for FJ such that:

  • FJ wins
  • Bessie couldn't have forced a win for herself at any point
→ Ответить