Robot Motion
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 9220 Accepted Submission(s):
4223
Problem 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)
Source
Recommend
很简单的题，无故错了好多次，数组要看全局的，不开会WA，完全不懂为什么~~~
题意：给定一个n*m的矩阵，矩阵由ESWN字母组成，表示方向。再输入k，表示机器人从矩阵北方第k格进入。每前进一格，机器人根据格子中的字母改变方向。
问需要多少时间才能走出矩阵，或者走几步后会陷入几步的循环。
问需要多少时间才能走出矩阵，或者走几步后会陷入几步的循环。
附上代码：
1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 using namespace std; 5 char map[20][20]; 6 int vis[20][20]; 7 int main() 8 { 9 10 int n,m,k,i,j; 11 while(~scanf("%d%d",&n,&m)) 12 { 13 if(n==0&&m==0) 14 break; 15 scanf("%d",&k); 16 memset(vis,0,sizeof(vis)); 17 memset(map,' ',sizeof(map)); 18 for(i=0; i<n; i++) 19 scanf("%s",map[i]); 20 int s=1,flag=0; 21 int x=0,y=k-1,w=0; 22 while(1) 23 { 24 if(map[x][y]=='N'&&!vis[x][y]) 25 { 26 vis[x][y]=s; 27 x--; 28 } 29 else if(map[x][y]=='S'&&!vis[x][y]) 30 { 31 vis[x][y]=s; 32 x++; 33 } 34 else if(map[x][y]=='E'&&!vis[x][y]) 35 { 36 vis[x][y]=s; 37 y++; 38 } 39 else if(map[x][y]=='W'&&!vis[x][y]) 40 { 41 vis[x][y]=s; 42 y--; 43 } 44 else if(vis[x][y]) 45 { 46 s--; 47 w=s-vis[x][y]+1; 48 flag=1; 49 break; 50 } 51 else if(x<0||y<0||x>=n||y>=m) 52 { 53 s--; 54 break; 55 } 56 s++; 57 } 58 if(flag) 59 printf("%d step(s) before a loop of %d step(s) ",s-w,w); 60 else 61 printf("%d step(s) to exit ",s); 62 } 63 return 0; 64 }