Children of the Candy Corn
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 12060 Accepted: 5177
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.
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.
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
题意: 三个询问:
1.溜着左墙走
↑0
←1
↓2
→3
先+1走,不然+3
如果不可以前进,那么接下来选取的方向为0,
如果依旧不能行进,接下来的方向选取的是3;
2.右着走;
3.bfs 求最短路;
#include<iostream>
#include<queue>
#include<string.h>
#include<stdio.h>
using namespace std;
int T;
int ansl,ansr,ans;
int n,m;
int sx,sy,ex,ey;
char s[44];
int ma[41][41];
int flag=0;
int di[4][2]={{-1,0},{0,-1},{1,0},{0,1}};
struct node{
int x,y,step;
node(int xx,int yy,int st)
{
x=xx,y=yy,step=st;
} node(){}
};
queue<node> q;
int vis[41][41];
bool can(int x,int y)
{
if(x>0&&y>0&&x<=n&&y<=m&&ma[x][y]==0&&vis[x][y]==0) return 1;
return 0;
}
void bfs()
{
memset(vis,0,sizeof(vis));
while(!q.empty()) q.pop();
q.push(node(sx,sy,1));
vis[sx][sy]=1;
while(!q.empty())
{
node now=q.front();
q.pop();
for(int i=0;i<4;i++)
{
int mx=now.x+di[i][0];
int my=now.y+di[i][1];
if(can(mx,my))
{
//cout<<now.x<<" "<<now.y<<" "<<di[i][0]<<" "<<di[i][1]<<endl;
if(mx==ex&&my==ey)
{
ans=now.step+1;
flag=1;
}
vis[mx][my]=1;
q.push(node(mx,my,now.step+1));
}
}
if(flag==1) break;
}
}
int cnt=0;
void dfs1(int x,int y,int step,int d)
{
if(x==ex&&y==ey)
{
ansl=step;
return;
}
int tx=x+di[(1+d)%4][0];
int ty=y+di[(1+d)%4][1];
if(tx>0&&ty>0&&tx<=n&&ty<=m&&ma[tx][ty]==0) dfs1(tx,ty,step+1,(d+1)%4);
else
dfs1(x,y,step,(d+3)%4);
}
void dfs2(int x,int y,int step,int d)
{
if(x==ex&&y==ey)
{
ansr=step;
return;
}
int tx=x+di[(3+d)%4][0];
int ty=y+di[(3+d)%4][1];
if(tx>0&&ty>0&&tx<=n&&ty<=m&&ma[tx][ty]==0) dfs2(tx,ty,step+1,(d+3)%4);
else
dfs2(x,y,step,(d+1)%4);
}
int main()
{
scanf("%d",&T);
while(T--)
{
flag=0;
scanf("%d%d",&m,&n);
memset(ma,0,sizeof(ma));
for(int i=1;i<=n;i++)
{
scanf("%s",s);
for(int j=1;j<=m;j++)
{
if(s[j-1]=='.') ma[i][j]=0;
else
{
if(s[j-1]=='S')
{
sx=i,sy=j;
ma[i][j]=0;
}
else if(s[j-1]=='E')
{
ex=i,ey=j;
ma[i][j]=0;
}
else ma[i][j]=1;
}
}
}
dfs1(sx,sy,1,0);
dfs2(sx,sy,1,0);
bfs();
printf("%d %d %d\n",ansl,ansr,ans);
}
}