Children of the Candy Corn（新颖题目和BFS最短路，没事可以拿出来品品）

Children of the Candy Corn

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

题解：

输入N*M地图‘#’为墙‘.’为路。输出三个数，分别为靠左墙行走（前方为墙右转）、靠右墙行走（前方为墙左转）和最短路的步数。

代码如下：

#include <stdio.h>
#include <string.h>
int right[4][2] = { {1,0},{0,1},{-1,0},{0,-1} };
int left[4][2] = { {1,0},{0,-1},{-1,0},{0,1} };
char map[45][45];
int si, sj, ei, ej;
int dir;
int q[2500][2];
int flag[45][45];
int n, m;
int dfs_left(int ni, int nj, int step)
{
    if ( ni==ei && nj==ej )
        return step+1;
    if ( ni<0 || ni>=n || nj<0 || nj>=m )
        return 0;
    if ( map[ni][nj]=='#' )
        return 0;
    dir = (dir+3)%4;//暂时不懂
    while ( 1 )//寻找下一步该往哪个方向走
    {
        int tmp = dfs_left( ni+left[dir][0], nj+left[dir][1], step+1 );
        if ( tmp>0 )
            break;
        dir = (dir+1)%4;
    }
}
int dfs_right(int ni, int nj, int step)
{
    if ( ni==ei && nj==ej )
        return step+1;
    if ( ni<0 || ni>=n || nj<0 || nj>=m )
        return 0;
    if ( map[ni][nj]=='#' )
        return 0;
    dir = (dir+3)%4;
    while ( 1 )
    {
        int tmp = dfs_right( ni+right[dir][0], nj+right[dir][1], step+1 );
        if ( tmp>0 )
            break;
        dir = (dir+1)%4;
    }

}
int bfs()//BFS最短路
{
    memset( flag, 0, sizeof(flag) );
    int head = 0;
    int tail = 0;
    q[tail][0] = si;
    q[tail++][1] = sj;
    flag[si][sj] = 1;
    int step = 0;
    while ( head<tail && flag[ei][ej]==0 )
    {
        int tmp = tail;
        step++;
        while ( head<tmp && flag[ei][ej]==0 )
        {
            int ni = q[head][0];
            int nj = q[head++][1];
            for ( int i=0; i<4; i++ )
            {
                int ti = ni+right[i][0];
                int tj = nj+right[i][1];
                if ( ti>=0 && ti<n && tj>=0 && tj<m && flag[ti][tj]==0
                    && map[ti][tj]!='#' )
                {
                    q[tail][0] = ti;
                    q[tail++][1] = tj;
                    flag[ti][tj] = 1;
                }
            }
        }
    }
    return step+1;
}
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' )
                    si = i, sj=j;
                if ( map[i][j] =='E' )
                    ei = i, ej= j;
            }
        }
        dir = 0;
        printf("%d %d %d\n", dfs_left(si,sj,0), dfs_right(si,sj,0), bfs() );
    }
    return 0;
}