Robot Motion(水题)
来源:互联网 发布:vmware虚拟机网络桥接 编辑:程序博客网 时间:2024/06/09 11:10
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 5NEESWEWWWESSSNWWWW4 5 1SESWEEESNWNWEENEWSEN0 0 0
Sample Output
10 step(s) to exit3 step(s) before a loop of 8 step(s)
#include<stdio.h>#include<string.h>int step,n,m;int a[1010][1010];char map[11][11];void DFS(int x,int y){ while(x>=0&&y>=0&&x<n&&y<m&&map[x][y]!='O') { if(map[x][y]=='N') { map[x][y]='O'; a[x][y]=++step; x--; } else if(map[x][y]=='S') { map[x][y]='O'; a[x][y]=++step; x++; } else if(map[x][y]=='E') { map[x][y]='O'; a[x][y]=++step; y++; } else if(map[x][y]=='W') { map[x][y]='O'; a[x][y]=++step; y--; } } if(map[x][y]=='O') printf("%d step(s) before a loop of %d step(s)\n",a[x][y]-1,step+1-a[x][y]); else printf("%d step(s) to exit\n",step);}int main(){ int i,k,x,y; while(scanf("%d%d%d",&n,&m,&k)!=EOF) { memset(map,0,sizeof(map)); if(n==0||m==0) break; for(i=0;i<n;i++) scanf("%s",map[i]); x=0; y=k-1; step=0; DFS(x,y); } return 0;}
0 0
- Robot Motion(水题)
- Robot Motion
- Robot Motion
- Robot Motion
- Robot Motion
- Robot Motion
- Robot Motion
- Robot Motion
- Robot Motion
- Robot Motion
- Robot Motion
- HDU 1035 Robot Motion(水题,模拟)
- poj 1573 Robot Motion
- Poj 1573 Robot Motion
- hdu 1035 Robot Motion
- HDU 1035 Robot Motion
- hdoj 1035 Robot Motion
- hdu 1035 Robot Motion
- HDU 1027 Ignatius and the Princess II【求第M个排列】
- hdu 1226 超级密码 bfs
- OGEngine
- [深入浅出Cocoa]iOS网络编程之Socket
- Java实现几种常见排序方法
- Robot Motion(水题)
- HDU3395 Special Fish 费用流
- oc协议,延展,分类
- setCompoundDrawables与setCompoundDrawablesWithIntrinsicBounds的区别
- oc 打僵尸 定义僵尸类
- [LeetCode] Edit Distance和Distance Subsequences
- linux shell 时间运算以及时间差计算方法
- java排序算法总结
- 学习Mysql点点滴滴