POJ3083 Children of the Candy Corn dfs+bfs

Children of the Candy Corn

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9629		Accepted: 4181

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中最难的了（见识的很少），一个求起点一直向左走（顺时针），一个一直向右走（逆时针），和最小的

起点到终点的步数，这个题我也是看别人代码，想了一天，细节我写在代码中，不好描述，看不懂就好好想想，我也有点混沌，

我就写出我看懂的，看代码之前请拿支笔 写    右  0， 上1，左2，下3；(只要（逆时针就行)

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
#define N 50

char a[N][N];

int step[4][2]={0,1,-1,0,0,-1,1,0};//可以改变，但是一定要是逆时针

int sx,sy,ex,ey;

struct stud{
    stud(int xx,int yy,int dd):x(xx),y(yy),d(dd){}
    stud(){}
  int x,y,d;
}s,e;

int ans,ans1,ans2;

int n,m;

void dfs(struct stud s,int time,int c)
{
      if(s.x==ex&&s.y==ey)
      {
          ans=time;
          return ;
      }

     for(int i=-1;i<3;i++)
     {
         int x,y,d;
         d=(s.d+i*c+4)%4;  //这是非常关键的一步，c有正负之分
                           //记住d记录的是上一步走完后的方向（面朝哪个方向）
                           //请看着图模拟过程

         x=s.x+step[d][0];
         y=s.y+step[d][1];

         if(x>=0&&x<n&&y>=0&&y<m&&a[x][y]!='#')
         {
             dfs(stud(x,y,d),time+1,c);
             return ;
         }
     }
}

void bfs()
{
    ans=0;
    int i,j;

     struct stud cur,next;
     cur.x=sx;
     cur.y=sy;
     cur.d=1;

     queue<stud>q;

      q.push(cur);

      while(!q.empty())
      {
          cur=q.front();
          q.pop();

          if(cur.x==ex&&cur.y==ey)
          {
              ans=cur.d;
              return ;
          }
          for(i=0;i<4;i++)
          {
              int xx=cur.x+step[i][0];
              int yy=cur.y+step[i][1];
              if(xx>=0&&xx<n&&yy>=0&&yy<m&&a[xx][yy]!='#'&&a[xx][yy]!='S')
              {
                  a[xx][yy]='#';
                  next.x=xx;
                  next.y=yy;
                  next.d=cur.d+1;
                  q.push(next);
              }
          }
      }
}
int main()
{
    int i,j,t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&m,&n);
        for(i=0;i<n;i++)
        {
            scanf("%s",a[i]);
            for(j=0;j<m;j++)
            {
                if(a[i][j]=='S')
                {
                    sx=i;
                    sy=j;
                }

                if(a[i][j]=='E')
                {
                    ex=i;
                    ey=j;
                }
            }
        }

        int d1,d2;
        s.x=sx;
        s.y=sy;

        if(sx==0)  //看着画的图看，人在哪边，他对面是他的方向，
                    //（其实没什么，好像可以赋值，0~3）
          s.d=3;

        if(sx==n-1)
          s.d=1;

        if(sy==0)
          s.d=0;

        if(sy==m-1)
          s.d=2;

        dfs(s,1,-1);
        ans1=ans;

        dfs(s,1,1);
        ans2=ans;

        bfs();

       printf("%d %d %d\n",ans1,ans2,ans);
    }
    return 0;
}