USACO 2.4 The Tamworth Two

#include <stdio.h>
#define DEBUG 1
#define TESTCASES 9
char map[11][11];
int cowRow, cowColumn, farmerRow, farmerColumn;
int directionArray[4][2] = {-1, 0, 0, 1, 1, 0, 0, -1};
int cowDirection, farmerDirection;

int isMeet(){
	return cowRow == farmerRow && cowColumn == farmerColumn;
}

void move(int *row, int *column, int *direction){
	int nextRow = *row + directionArray[*direction][0];
	int nextColumn = *column + directionArray[*direction][1];
	if (nextRow < 0 || nextRow == 10 || nextColumn < 0 || nextColumn == 10 || map[nextRow][nextColumn] == '*')
		*direction = (*direction + 1) % 4;
	else {
		*row = nextRow;
		*column = nextColumn;
	}
}

int main(){
#if DEBUG
	int testCase;
	for (testCase = 1; testCase <= TESTCASES; testCase++){
		char inputFileName[20] = "inputx.txt";
		inputFileName[5] = '1' +  (testCase - 1);
		freopen(inputFileName, "r", stdin);
		printf("\n#%d\n", testCase);
#endif

	int row;
	for (row = 0; row < 10; row++){
		scanf("%s", map[row]);
		int column;
		for (column = 0 ; column <= 10; column++){
			if (map[row][column] == 'C'){
				cowRow = row;
				cowColumn = column;
				//注意牛的起点要转换成可以经过的点,农民的起点也一样
				map[row][column] == '.';
				continue;
			}
			if (map[row][column] == 'F'){
				farmerRow = row;
				farmerColumn = column;
				map[row][column] = '.';
			}
		}
	}

	cowDirection = farmerDirection = 0;

	int minute;
	for (minute = 1; minute <= 1e6; minute++){
		move(&cowRow, &cowColumn, &cowDirection);
		move(&farmerRow, &farmerColumn, &farmerDirection);
		if (isMeet()){
			printf("%d\n", minute);
			break;
		}
	}
	if (!isMeet())
		printf("0\n");
#if DEBUG
	}
#endif
	return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值