POJ-1573-Robot Motion-2013-12-15 00:46:22
来源:互联网 发布:数据封装过程 编辑:程序博客网 时间:2024/06/05 22:49
Robot Motion
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9547 Accepted: 4631
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)
Source
Mid-Central USA 1999
# include<stdio.h># include<string.h>int main(){char s[12][12],a;int mn[12][12];int rows,columns,n,i,j,num,num1,flag;while(scanf("%d %d %d",&rows,&columns,&n) && rows!=0 || columns!=0 || n!=0){memset(s,0,sizeof(s));memset(mn,0,sizeof(mn));getchar();for(i=1;i<=rows;i++){for(j=1;j<=columns;j++){scanf("%c",&s[i][j]);}getchar();}i = 1;j = n;mn[i][j] = 1;num = 0;flag = 0;while(1){if(mn[i][j]==0 && (i==0 || j==0 || i==rows+1 || j==columns+1)){flag = 1;break;}if(s[i][j]=='W'){num++;mn[i][j] = num;num1 = mn[i][j];j--;}else if(s[i][j]=='E'){num++;mn[i][j] = num;num1 = mn[i][j];j++;}else if(s[i][j]=='N'){num++;mn[i][j] = num;num1 = mn[i][j];i--;}else if(s[i][j]=='S'){num++;mn[i][j] = num;num1 = mn[i][j];i++;}if(mn[i][j]!=0){flag = 2;num = mn[i][j] - 1;num1 -= num;break;}}if(flag==1)printf("%d step(s) to exit\n",num);else if(flag==2)printf("%d step(s) before a loop of %d step(s)\n",num,num1);}return 0;}
0 0
- POJ-1573-Robot Motion-2013-12-15 00:46:22
- poj 1573 Robot Motion
- Poj 1573 Robot Motion
- poj 1573 Robot Motion
- POJ 1573 - Robot Motion
- poj-1573-Robot Motion
- POJ 1573 Robot Motion
- POJ 1573 Robot Motion
- POJ-1573-Robot Motion
- poj 1573 Robot Motion
- POJ 1573 Robot Motion
- POJ 1573 Robot Motion.
- poj 1573 Robot Motion
- POJ -1573 Robot Motion
- POJ 1573:Robot Motion
- poj 1573 Robot Motion
- poj 1573 Robot Motion
- POJ 1573 Robot Motion
- POJ-1068-Parencodings-2013-12-12 23:34:16
- LeetCode (P)
- 自定义Annotation
- 几个学习的网站
- c++心得体会
- POJ-1573-Robot Motion-2013-12-15 00:46:22
- 整理笔记——正则表达式总结
- HTML中设置多个class属性的优先级
- windows命令行(DOS命令)
- 改变模拟器的屏幕尺寸
- Struts2拦截器实现细颗粒权限控制
- 嵌入式 简单的宏在编译的时候进行定义
- GCC-4.4.3 installation on Ubuntu 12.04-amd64【light测试不成功,仅仅是参考价值】
- 配置JAVA的环境变量