USACO section 2.4 The Tamworth Two(算模拟吧)_a pair of cows is loose somewhere in the forest. f-CSDN博客

本文链接：https://blog.csdn.net/nealgavin/article/details/7984963

博客分析了USACO中关于农夫John追捕两只逃窜奶牛的问题。在10x10网格中，根据双方的固定移动模式，通过模拟他们的行进路径来确定相遇所需的时间。如果在400000步内未相遇，则说明他们永远不会相遇，因为会陷入无限循环。解决方案是跟踪每个实体的位置和方向，通过数组deltax和deltay确定移动方式。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

The Tamworth Two
BIO '98 - Richard Forster

A pair of cows is loose somewhere in the forest. Farmer John is lending his expertise to their capture. Your task is to model their behavior.

The chase takes place on a 10 by 10 planar grid. Squares can be empty or they can contain:

an obstacle,
the cows (who always travel together), or
Farmer John.

The cows and Farmer John can occupy the same square (when they `meet') but neither the cows nor Farmer John can share a square with an obstacle.

Each square is
represented
as follows:

. Empty square
* Obstacle
C Cows
F Farmer

Here is a sample grid:

*...*.....
......*...
...*...*..
..........
...*.F....
*.....*...
...*......
..C......*
...*.*....
.*.*......

The cows wander around the grid in a fixed way. Each minute, they either move forward or rotate. Normally, they move one square in the direction they are facing. If there is an obstacle in the way or they would leave the board by walking `forward', then they spend the entire minute rotating 90 degrees clockwise.

Farmer John, wise in the ways of cows, moves in exactly the same way.

The farmer and the cows can be considered to move simultaneously during each minute. If the farmer and the cows pass each other while moving, they are not considered to have met. The chase ends when Farmer John and the cows occupy the same square at the end of a minute.

Read a ten-line grid that represents the initial state of the cows, Farmer John, and obstacles. Each of the ten lines contains exactly ten characters using the coding above. There is guaranteed to be only one farmer