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 0
Sample Output
10 step(s) to exit
3 step(s) before a loop of 8 step(s)
改模板时要考虑的一点:因为可能一直循环,要标记每次走到的坐标,和此时用的步数。用于计算之后的圈需要多少步。
还有很重要的一点:***形成的圈可能是从起点开始的,所以sp[ ][ ]中对应起点的步数应为0。***
#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
using namespace std;
#define MAX 15
int n,m,dir;
struct st{
int x,y,step;
friend bool operator <(st a,st b){
return a.step>b.step;
}
}a,b;
char mp[MAX][MAX]; //记录地图
int vis[MAX][MAX]; //标记走过的点
int sp[MAX][MAX]; //记录走到该点用的步数
void bfs(int ox,int oy){
priority_queue<st> que;
memset(vis,0,sizeof(vis));
memset(sp,-1,sizeof(sp));
int step=0,ans=-1,cir=-1;
a.x=ox;a.y=oy;a.step=step;
que.push(a);
vis[a.x][a.y]=1;
sp[a.x][a.y]=0;//可能会在第一步时出不去,就一直是个圈了。
while(!que.empty()){
a=que.top();
que.pop();
if(mp[a.x][a.y]=='N') {
b.x=a.x-1;b.y=a.y;
}
if(mp[a.x][a.y]=='S') {
b.x=a.x+1;b.y=a.y;
}
if(mp[a.x][a.y]=='W') {
b.y=a.y-1;b.x=a.x;
}
if(mp[a.x][a.y]=='E') {
b.y=a.y+1;b.x=a.x;
}
b.step=a.step+1;
if(b.x<0||b.y<0||b.x>=n||b.y>=m){ ans=b.step;break;}
else if(vis[b.x][b.y]==1&&sp[b.x][b.y]>=0){ cir=b.step-sp[b.x][b.y];ans=sp[b.x][b.y];break; }
que.push(b);
sp[b.x][b.y]=b.step;
vis[b.x][b.y]=1; //记得标记!!!
}
if(cir<0) printf("%d step(s) to exit\n",ans);
else printf("%d step(s) before a loop of %d step(s)\n",ans,cir);
}
int main(){
while(scanf("%d%d%d",&n,&m,&dir)!=EOF,(n||m||dir)){
int i;
for(i=0;i<n;++i) scanf("%s",mp[i]);
int ox=0,oy=dir-1;
bfs(ox,oy);
}
return 0;
}