The Tamworth Two_usaco2.4.1_模擬

NO IMAGE

DESCRIPTION


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 and one pair of cows. The cows and Farmer John will not initially be on the same square.

Calculate the number of minutes until the cows and Farmer John meet. Assume both the cows and farmer begin the simulation facing in the `north’ direction. Print 0 if they will never meet.

PROGRAM NAME: ttwo


INPUT FORMAT


Lines 1-10: Ten lines of ten characters each, as explained above

OUTPUT FORMAT


A single line with the integer number of minutes until Farmer John and the cows meet. Print 0 if they will never meet.

ANALYSIS


看上去很難但實際上水
暴力模擬一下走法,遇到障礙物就轉彎
用桶記錄一下兩人的位置作為狀態
不相遇的情況是同一狀態兩人走了多次
就這樣

CODE


/*
ID:wjp13241
PROG:ttwo
LANG:C  
*/
/*
ASCII_*:42
ASCII_.:46
ASCII_C:67
ASCII_F:70
*/
#include <stdio.h>
#define n 10
using namespace std;
struct pos
{
int x,y;
bool operator==(pos a)
{
return a.x==x&&a.y==y;
}
pos operator (pos a)
{
return (pos){a.x x,a.y y};
}
};
pos drct[4]={{-1,0},{0,1},{1,0},{0,-1}};
pos cow,farmer;
int map[n 2][n 2];
int bct[n 2][n 2][n 2][n 2];
char s[10];
int turn(int dir)
{
return (dir 1)%4;
}
void move(pos &obj,int &dir)
{
pos tar=obj drct[dir];
if (tar.x>0&&tar.x<n 1&&tar.y>0&&tar.y<n 1&&map[tar.x][tar.y]!=42)
obj=tar;
else
dir=turn(dir);
}
int main()
{
freopen("ttwo.in","r",stdin);
freopen("ttwo.out","w",stdout);
int fdir=0,cdir=0,cnt=0;
for (int i=1;i<=n;i  )
{
scanf("%s",s);
for (int j=1;j<=n;j  )
{
map[i][j]=(int)(s[j-1]);
if (map[i][j]==67)
cow=(pos){i,j};
if (map[i][j]==70)
farmer=(pos){i,j};
}
}
while (!(farmer==cow))
{
cnt  ;
move(farmer,fdir);
move(cow,cdir);
if (bct[farmer.x][farmer.y][cow.x][cow.y]>5)
{
printf("0\n");
return 0;
}
bct[farmer.x][farmer.y][cow.x][cow.y]  ;
}
printf("%d\n",cnt);
}