关闭

poj1101_The Game

371人阅读 评论(0) 收藏 举报
The Game
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 8573   Accepted: 2611

Description

One morning, you wake up and think: "I am such a good programmer. Why not make some money?'' So you decide to write a computer game. 
The game takes place on a rectangular board consisting of w * h squares. Each square might or might not contain a game piece, as shown in the picture. 

One important aspect of the game is whether two game pieces can be connected by a path which satisfies the two following properties: 

It consists of straight segments, each one being either horizontal or vertical. 


It does not cross any other game pieces. 

(It is allowed that the path leaves the board temporarily.) 

Here is an example: 

The game pieces at (1,3) and at (4, 4) can be connected. The game pieces at (2, 3) and (3, 4) cannot be connected; each path would cross at least one other game piece. 

The part of the game you have to write now is the one testing whether two game pieces can be connected according to the rules above.

Input

The input contains descriptions of several different game situations. The first line of each description contains two integers w and h (1 <= w,h <= 75), the width and the height of the board. The next h lines describe the contents of the board; each of these lines contains exactly w characters: a "X" if there is a game piece at this location, and a space if there is no game piece. 

Each description is followed by several lines containing four integers x1, y1, x2, y2 each satisfying 1 <= x1,x2 <= w, 1 <= y1,y2 <= h. These are the coordinates of two game pieces. (The upper left corner has the coordinates (1, 1).) These two game pieces will always be different. The list of pairs of game pieces for a board will be terminated by a line containing "0 0 0 0". 

The entire input is terminated by a test case starting with w=h=0. This test case should not be procesed.

Output

For each board, output the line "Board #n:", where n is the number of the board. Then, output one line for each pair of game pieces associated with the board description. Each of these lines has to start with "Pair m: ", where m is the number of the pair (starting the count with 1 for each board). Follow this by "ksegments.", where k is the minimum number of segments for a path connecting the two game pieces, or "impossible.", if it is not possible to connect the two game pieces as described above. 

Output a blank line after each board.

Sample Input

5 4
XXXXX
X   X
XXX X
 XXX 
2 3 5 3
1 3 4 4
2 3 3 4
0 0 0 0
0 0

Sample Output

Board #1:
Pair 1: 4 segments.
Pair 2: 3 segments.
Pair 3: impossible.

分析:简单广搜, 记录上一个状态的方向。注意:起点和终点相邻时,为一个段。

#include <iostream>
#include <cstdio>
#include <cstring>
#include<queue>
using namespace std;

struct Data
{
	int x, y, sum, num;
	int xiang;//记录方向
};

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int dd[] = {0, 2, 3, 1};//方向数组
bool visit[80][80];
char map[80][80];
int n, m;
int mmin = 100000;//最少段

queue<Data>q;

int bfs(int x, int y, int a, int b)
{
	if (x == a && y == b)
		return 0;
	Data data, c;
	data.x = x;
	data.y = y;
	data.sum = 0;
	data.num = 0;
	visit[x][y] = 1;
	q.push(data);
	while (!q.empty())
	{
		data = q.front();
		q.pop();
		for (int i = 0; i < 4; i++)
		{
			c.x = data.x + dx[i];
		    c.y = data.y + dy[i];
			c.xiang = dd[i];
			if (c.x == a && c.y == b)
			{
				if (data.sum != 0 && c.xiang != data.xiang)
					c.num = data.num + 1;
				else
					c.num = data.num;
				if (mmin > c.num + 1)
					mmin = c.num + 1;
			}
			if (c.x >= 0 && c.y >= 0 && c.x <= n + 1 && c.y <= m + 1 && map[c.x][c.y] != 'X' && !visit[c.x][c.y])
			{
				if (data.sum != 0 && c.xiang != data.xiang)
					c.num = data.num + 1;
				else 
					c.num = data.num;
				c.sum = data.sum + 1;
				visit[c.x][c.y] = 1;
				q.push(c);
			}
		}
	}			
	if (mmin != 100000)
		return mmin;
	else
		return -1;
}

int main()
{
	int cun = 1;
	while (scanf("%d%d", &m, &n) != EOF && n != 0 && m != 0)
	{
		getchar();
		memset(map, 0, sizeof(map));
		memset(visit, 0, sizeof(visit));
		while (!q.empty())
			q.pop();
		int i, j;
		for (i = 1; i <= n; i++)
		{
			for (j = 1; j <= m; j++)
				map[i][j] = getchar();
			getchar();
		}
        printf("Board #%d:\n", cun++);
		int x_st, y_st, x_end, y_end;
		int cot = 1;
		while (scanf("%d%d%d%d", &y_st, &x_st, &y_end, &x_end) == 4 && x_st != 0 && y_st != 0)
		{
			mmin = 100000;
			memset(visit, 0, sizeof(visit));
            while (!q.empty())
				q.pop();
			if ((x_st - y_st == 1 || x_st - y_st == -1) && x_end == y_end || (x_end - y_end == 1 || y_end - x_end == -1) && x_st == y_st)
			{
				printf("Pair %d: 1 segments.\n", cot++);
				continue;
			}
			int k = bfs(x_st, y_st, x_end, y_end);
			if (k == -1)
				printf("Pair %d: impossible.\n", cot++);
			else 
				printf("Pair %d: %d segments.\n", cot++, k);
		}
		printf("\n");
	}
	return 0;
}


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:30525次
    • 积分:1254
    • 等级:
    • 排名:千里之外
    • 原创:101篇
    • 转载:0篇
    • 译文:0篇
    • 评论:4条
    文章分类
    最新评论