Pku oj 1573 Robot Motion(模拟)
2016-03-13 17:08
1041 查看
Robot Motion
Description
![](http://poj.org/images/1573_1.jpg)
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
Source
Mid-Central USA 1999
本来以为是dfs,不过想了想没那么麻烦,模拟水过,第一次条件写的太复杂了。。结果MLE,第二次没考虑0step的情况。。又错了一发
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 12027 | Accepted: 5829 |
![](http://poj.org/images/1573_1.jpg)
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)
Source
Mid-Central USA 1999
本来以为是dfs,不过想了想没那么麻烦,模拟水过,第一次条件写的太复杂了。。结果MLE,第二次没考虑0step的情况。。又错了一发
#include<iostream> #include<cstring> #include<cstdio> using namespace std; int vis[1000][1000]; char a[1000][1000]; int main() { int n,m,s; int i,j,k; while(~scanf("%d%d%d",&n,&m,&s)&&(n+m+s)) { getchar(); int flag=0; int cnt3=0; for(i=0;i<n;i++) { for(j=0;j<m;j++) { scanf("%c",&a[i][j]); } getchar(); } memset(vis,0,sizeof(vis)); int cnt=0; i=0; j=s-1; vis[i][j]=-1; while(1) { vis[i][j]++; if(vis[i][j]==2) { flag=1; } if(flag==1) cnt3++; else cnt++; if(vis[i][j]==3) { break; } if(i<0||i==n||j<0||j==m) { flag=2; break; } if(a[i][j]=='W') { j--; continue; } if(a[i][j]=='E') { j++; continue; } if(a[i][j]=='S') { i++; continue; } if(a[i][j]=='N') { i--; continue; } } if(flag==2) { printf("%d step(s) to exit\n",cnt-1); } else { if(cnt3-1==n*m) cnt=0; else cnt=cnt-cnt3+1; printf("%d step(s) before a loop of %d step(s)\n",cnt,cnt3-1); } } }
相关文章推荐
- 在JDBC中使用PreparedStatement代替Statement,同时预防SQL注入
- 构建一个简单的Linux系统 MenuOs —— start_kernel到init进程(20135304刘世鹏)
- 第一周笔记
- 第一周学习感想和以往回顾
- plsa(Probabilistic Latent Semantic Analysis) 概率隐语义分析
- 第一讲: 软考中高项01_信息基础+服务管理
- c++第2次实验(循环)
- Windows系统下安装Ubuntu虚拟机
- 《Java程序设计》第二周学习总结
- IDEA社区版使用Maven + Tomcat开发Web项目
- 第一次上机实验1-2
- Git使用教程
- MySQL索引
- 20145329 吉东云《Java程序设计》第二周学习总结
- 最小生成树--kruskal
- linux用户和权限管理
- QT5中文显示出现乱码
- Apache2.4和Apache2.2访问控制配置比较
- WCF学习教程地址
- 第3周项目4 换钱币