Children of the Candy Corn
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 10145 | Accepted: 4405 |
Description
The cornfield maze is a popular Halloween treat. Visitors are shown the entrance and must wander through the maze facing zombies, chainsaw-wielding psychopaths, hippies, and other terrors on their quest to find the exit.
One popular maze-walking strategy guarantees that the visitor will eventually find the exit. Simply choose either the right or left wall, and follow it. Of course, there's no guarantee which strategy (left or right) will be better, and the path taken is seldom the most efficient. (It also doesn't work on mazes with exits that are not on the edge; those types of mazes are not represented in this problem.)
As the proprieter of a cornfield that is about to be converted into a maze, you'd like to have a computer program that can determine the left and right-hand paths along with the shortest path so that you can figure out which layout has the best chance of confounding visitors.
One popular maze-walking strategy guarantees that the visitor will eventually find the exit. Simply choose either the right or left wall, and follow it. Of course, there's no guarantee which strategy (left or right) will be better, and the path taken is seldom the most efficient. (It also doesn't work on mazes with exits that are not on the edge; those types of mazes are not represented in this problem.)
As the proprieter of a cornfield that is about to be converted into a maze, you'd like to have a computer program that can determine the left and right-hand paths along with the shortest path so that you can figure out which layout has the best chance of confounding visitors.
Input
Input to this problem will begin with a line containing a single integer n indicating the number of mazes. Each maze will consist of one line with a width, w, and height, h (3 <= w, h <= 40), followed by h lines of w characters each that represent the maze layout. Walls are represented by hash marks ('#'), empty space by periods ('.'), the start by an 'S' and the exit by an 'E'.
Exactly one 'S' and one 'E' will be present in the maze, and they will always be located along one of the maze edges and never in a corner. The maze will be fully enclosed by walls ('#'), with the only openings being the 'S' and 'E'. The 'S' and 'E' will also be separated by at least one wall ('#').
You may assume that the maze exit is always reachable from the start point.
Exactly one 'S' and one 'E' will be present in the maze, and they will always be located along one of the maze edges and never in a corner. The maze will be fully enclosed by walls ('#'), with the only openings being the 'S' and 'E'. The 'S' and 'E' will also be separated by at least one wall ('#').
You may assume that the maze exit is always reachable from the start point.
Output
For each maze in the input, output on a single line the number of (not necessarily unique) squares that a person would visit (including the 'S' and 'E') for (in order) the left, right, and shortest paths, separated by a single space each. Movement from one square to another is only allowed in the horizontal or vertical direction; movement along the diagonals is not allowed.
Sample Input
2 8 8 ######## #......# #.####.# #.####.# #.####.# #.####.# #...#..# #S#E#### 9 5 ######### #.#.#.#.# S.......E #.#.#.#.# #########
Sample Output
37 5 5 17 17 9
Source
South Central USA 2006
题目链接:http://poj.org/problem?id=3083
题目大意:一个m*n的矩阵给出起点和终点求两点间左优先路,右优先路和最短路
题目链接:http://poj.org/problem?id=3083
题目大意:一个m*n的矩阵给出起点和终点求两点间左优先路,右优先路和最短路
题目分析:最短显然用BFS裸的,左右优先用DFS做
#include <cstdio>
#include <queue>
#include <cstring>
using namespace std;
int n, m;
int sx, sy, ex, ey;
char map[42][42];
bool vis[42][42];
int dx[] = {1, 0, -1, 0}; //方向不能反!
int dy[] = {0, 1, 0, -1};
struct Node
{
int x, y;
int step;
};
queue <Node> q;
bool flag;
int l, r; //记录左优先和右优先的解
int BFS() //求最短
{
memset(vis, 0, sizeof(vis));
Node t, cur, st;
st.x = sx;
st.y = sy;
vis[sx][sy] = true;
st.step = 1;
q.push(st);
while(!q.empty())
{
cur = q.front();
q.pop();
if(cur.x == ex && cur.y == ey)
{
while(!q.empty())
q.pop();
return cur.step;
}
for(int i = 0; i < 4; i++)
{
t.x = cur.x + dx[i];
t.y = cur.y + dy[i];
t.step = cur.step + 1;
if(t.x < n && t.y < m && t.x >= 0 && t.y >= 0 && !vis[t.x][t.y] && map[t.x][t.y] != '#')
{
vis[t.x][t.y] = true;
q.push(t);
}
}
}
return 0;
}
int DFS(int x, int y, int dir)
{
if(x == ex && y == ey)
return 1;
for(int i = 0; i < 4; i++)
{
int xx = x + dx[dir];
int yy = y + dy[dir];
if(map[xx][yy] == '.' || map[xx][yy] == 'E')
{
if(flag)
{
l++;
if(dir == 3)
dir = -1;
if(DFS(xx, yy, dir + 1))
return 1;
}
else
{
r++;
if(dir == 0)
dir = 4;
if(DFS(xx, yy, dir - 1))
return 1;
}
}
if(flag)
{
dir--;
if(dir == -1)
dir = 3;
}
else
{
dir++;
if(dir == 4)
dir = 0;
}
}
return 0;
}
int main()
{
int T;
scanf("%d", &T);
while(T--)
{
scanf("%d %d", &m, &n);
for(int i = 0; i < n; i++)
{
scanf("%s", map[i]);
for(int j = 0; j < m; j++)
{
if(map[i][j] == 'S')
{
sx = i;
sy = j;
}
if(map[i][j] == 'E')
{
ex = i;
ey = j;
}
}
}
flag = true;
l = r = 1;
DFS(sx, sy, 0);
flag = false;
DFS(sx, sy, 0);
printf("%d %d %d\n", l, r, BFS());
}
}