poj3083

Children of the Candy Corn Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4901 Accepted: 2212 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 Source South Central USA 2006

 

DFS+BFS:

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>

using namespace std;

typedef struct
{
    int x;
    int y;
    int dis;
}Node;

const int move[4][2]={{0,1},{1,0},{0,-1},{-1,0}};  //e s w n
char map[40][40];
bool visit[40][40];
queue<Node> node_Q;
int r,c;

int BFS()
{
    Node temp, temp1;
    int sp;

    sp=999999;
    while(!node_Q.empty())
    {
        temp=node_Q.front();
        node_Q.pop();
        if(map[temp.x][temp.y]=='E')
        {
            if(temp.dis<sp)
                sp= temp.dis;
        }
        for(int i=0; i<=3; i++)
        {
            temp1.x=temp.x+move[i][0];
            temp1.y=temp.y+move[i][1];
            temp1.dis=temp.dis+1;
            if(temp1.x>=0 && temp1.x<r && temp1.y>=0 && temp1.y<c && map[temp1.x][temp1.y]!='#' && !visit[temp1.x][temp1.y])
            {
                visit[temp1.x][temp1.y]=true;
                node_Q.push(temp1);
            }
        }
    }
    return sp;
}

int DFS(int x, int y, int dir, char mark)
{
    int nx, ny;
    int newDir;

    if(map[x][y]=='E')
    {
        return 1;
    }
    if(mark=='l')
    {
        for(int i=dir-1; i<=dir+2; i++)
        {
            newDir=(i+4)%4;
            nx=x+move[(i+4)%4][0];
            ny=y+move[(i+4)%4][1];
            if(nx>=0 && nx<r && ny>=0 && ny<c && map[nx][ny]!='#')
            {
               visit[nx][ny]=true;
               return 1+DFS(nx,ny,newDir,'l');
               visit[nx][ny]=false;
            }
        }
    }
    if(mark=='r')
    {
        for(int i=dir+1; i>=dir-2; i--)
        {
            newDir=(i+4)%4;
            nx=x+move[(i+4)%4][0];
            ny=y+move[(i+4)%4][1];
            if(nx>=0 && nx<r && ny>=0 && ny<c && map[nx][ny]!='#')
            {
               visit[nx][ny]=true;
               return 1+DFS(nx,ny,newDir,'r');
               visit[nx][ny]=false;
            }
        }
    }
}

int main()
{
    int cas;
    Node sNode;
    int lp, rp, sp;
    int dir; //e=0 s=1 w=2 n=3

    scanf("%d",&cas);
    while(cas--)
    {
        scanf("%d%d",&c,&r);
        for(int i=0; i<r; i++)
        {
            getchar();
            for(int j=0; j<c; j++)
            {
                scanf("%c",&map[i][j]);
                if(map[i][j]=='S')
                {
                    sNode.x=i;
                    sNode.y=j;
                    sNode.dis=1;
                }
            }
        }
        if(sNode.y==0)
            dir=0;
        else if(sNode.y==c-1)
            dir=2;
        else if(sNode.x==0)
            dir=1;
        else if(sNode.x==r-1)
            dir=3;
        //BFS
        memset(visit,0,sizeof(visit));
        node_Q.push(sNode);
        visit[sNode.x][sNode.y]=true;
        sp=BFS();
        //left DFS
        lp=DFS(sNode.x,sNode.y,dir,'l');
        //right DFS
        rp=DFS(sNode.x,sNode.y,dir,'r');

        printf("%d %d %d\n", lp, rp ,sp);
    }
    return 0;
}