HDU 1036 Robot Motion 深搜



Description

A robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to move are laid down in a grid. The possible instructions are

N north (up the page)
S south (down the page)
E east (to the right on the page)
W west (to the left on the page)

For example, suppose the robot starts on the north (top) side of Grid 1 and starts south (down). The path the robot follows is shown. The robot goes through 10 instructions in the grid before leaving the grid.

Compare what happens in Grid 2: the robot goes through 3 instructions only once, and then starts a loop through 8 instructions, and never exits.

You are to write a program that determines how long it takes a robot to get out of the grid or how the robot loops around.

 

Input

There will be one or more grids for robots to navigate. The data for each is in the following form. On the first line are three integers separated by blanks: the number of rows in the grid, the number of columns in the grid, and the number of the column in which the robot enters from the north. The possible entry columns are numbered starting with one at the left. Then come the rows of the direction instructions. Each grid will have at least one and at most 10 rows and columns of instructions. The lines of instructions contain only the characters N, S, E, or W with no blanks. The end of input is indicated by a row containing 0 0 0.

 

Output

For each grid in the input there is one line of output. Either the robot follows a certain number of instructions and exits the grid on any one the four sides or else the robot follows the instructions on a certain number of locations once, and then the instructions on some number of locations repeatedly. The sample input below corresponds to the two grids above and illustrates the two forms of output. The word "step" is always immediately followed by "(s)" whether or not the number before it is 1.

 

Sample Input

     
     
     
     

      
      
      
      3 6 5
NEESWE
WWWESS
SNWWWW
4 5 1
SESWE
EESNW
NWEEN
EWSEN
0 0 
     
     
     
     

 

Sample Output

     
     
     
     

      
      
      
      10 step(s) to exit
3 step(s) before a loop of 8 step(s)
     
     
     
     
     
     
     
     

      
      
      
      题意：就是给你n行m列的由N（向上）S（向下）W（向左）E（向右）组成的地图，写着什么就从那个方向走，如果能走出边界就打印出所走的步数，如果不是就计算出环的步数与不是环的步数。
     
     
     
     
     
     
     
     

      
      
      
      思路：深搜的题从入口进行深搜
     
     
     
     
     
     
     
     

      
      
      
      AC代码：
     
     
     
     
     
     
     
     

      
      
      
      #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
     
     
     
     
     
     
     
     

      
      
      
      int n;
int m;
char gra[1005][1005];
int visit[1005][1005];
int step,loop;
void dfs(int x,int y){
    if(y<0||y>=m||x<0||x>=n){
            printf("%d step(s) to exit\n",step);
        return;
    }//出界
    if(visit[x][y]==1){
        visit[x][y]++;//把头标记为2
        return ;
    }//到达环的有回溯
    visit[x][y]++;//走过一次标记 1
    step++;
    if(gra[x][y]=='N'){
        dfs(x-1,y);
    }
    if(gra[x][y]=='S'){
        dfs(x+1,y);
    }
    if(gra[x][y]=='W'){
        dfs(x,y-1);
    }
    if(gra[x][y]=='E'){
        dfs(x,y+1);
    }
    loop++;//环的步数
    if(visit[x][y]==2){//回溯到环的头
        printf("%d step(s) before a loop of %d step(s)\n",step-loop,loop);
    }
}
     
     
     
     
     
     
     
     

      
      
      
      int main(){
    int sy;
    while(~scanf("%d%d",&n,&m)&&n&&m){
        scanf("%d",&sy);
        getchar();
    for(int i=0;i<n;i++){
        gets( gra[i] );
    }
    memset(visit,0,sizeof(visit));
    step=0;
    loop=0;
    dfs(0,sy-1);
    }
    return 0;
}
注意：深搜的时候回溯回去的时候的处理。。。。。
     
     
     
     
     
     
     
     

      
      
      
      感觉深搜的题做起来有点小感觉了。。。。继续fighting