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.

Can anyone help?

You wrote

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:

If it is a two-player game, I can't understand why moves by Bessie are provided.

I guess I found what I was missing, lol. It might be something else. Anyway, thanks for the spark of inspiration, haha.

EDIT: I think it is what you were trying to tell, but, anyway xD