POJ 1573 Robot Motion(模拟)
2014-06-12 21:34
393 查看
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
Sample Output
模拟。。。没什么好说的,,详见代码。。
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 0
Sample Output
10 step(s) to exit 3 step(s) before a loop of 8 step(s)
模拟。。。没什么好说的,,详见代码。。
#include <stdio.h> #include <string.h> int m,n,k,i,j, x,y; //vis用来记录状态的 dis保存的是走到当前点所用的步数 char map[15][15]; int vis[15][15],dis[15][15],Map[15][15]; //jx,jy数组是用来进行移动的分别是对应 N S E W int jx []= {-1,1,0,0};//x坐标的移动 int jy []= {0,0,1,-1};//y坐标的移动 void BB (int k) { x=0; y=k; int s=0;//s是总的步数 如果vis[i]==0的时候就表示已经走过这点就可以跳出了 while (x>=0 && x < m && y >= 0 && y < n && vis[x][y]==0) { vis[x][y]=1; dis[x][y]=s; s++; int xx=x+jx[Map[x][y]]; int yy=y+jy[Map[x][y]]; x=xx; y=yy; } if (x>=0 && x < m && y >= 0 && y < n ) //如果还在x y的范围内就说明有环路存在 printf ("%d step(s) before a loop of %d step(s)\n",dis[x][y],s-dis[x][y]); else printf ("%d step(s) to exit\n",s); } int main () { while (~scanf ("%d%d%d",&m,&n,&k) && n &&m && k) { memset(vis,0,sizeof (vis)); memset(Map,-1,sizeof (Map)); memset(map,'\0',sizeof (map)); for (i=0; i<m; i++) { scanf ("%s%*c",map[i]); } for (i=0; i<m; i++) { for (j=0; j<n; j++) { if (map[i][j]=='N') Map[i][j]=0; else if (map[i][j]=='S') Map[i][j]=1; else if (map[i][j]=='E') Map[i][j]=2; else if (map[i][j]=='W') Map[i][j]=3; } } k=k-1; BB (k); } return 0; }
相关文章推荐
- POJ 1573 Robot Motion 模拟
- 模拟 POJ 1573 Robot Motion
- HDU 1035 && poj 1573 Robot Motion【模拟】
- POJ 1573 Robot Motion(小模拟)
- poj_1573 Robot Motion(简单模拟)
- Robot Motion(POJ 1573)(水题+纯模拟)
- POJ 1573 Robot Motion (模拟)
- POJ 1573 Robot Motion 模拟机器人行走
- POJ 1573 && hdu 1035 Robot Motion【简单模拟】
- POJ 1573 Robot Motion 模拟
- poj-1573-Robot Motion--模拟
- POJ 1573 && hdu 1035 Robot Motion(简单模拟)
- POJ 1573 && hdu 1035 Robot Motion【简单模拟】
- POJ 1573 Robot Motion (经典模拟)
- POJ-1573 Robot Motion 模拟水题
- POJ 1573:Robot Motion:简单模拟
- POJ 1573 Robot Motion (模拟+不回溯的dfs 水题)
- POJ 1573 Robot Motion 模拟
- POJ 1573 Robot Motion 水模拟
- 【POJ】1573 & 【HDU】1035 - Robot Motion(模拟)