Robot Motion
2015-07-29 20:18
267 查看
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
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 11408 | Accepted: 5533 |
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 <iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<cmath> using namespace std; int flag[110][110]; char s[128]; int xx[]= {0,0,1,0,-1}; int yy[]= {0,1,0,-1,0}; int mark; char ss[110][110]; int m,n; void solve(int x,int y) { int a,b; int i=0,cnt; flag[x][y]=1; int pos; bool jj=1; while(1) { a=x; b=y; x+=xx[s[ss[a][b]]]; y+=yy[s[ss[a][b]]]; if(x>=n||x<0||y>=m||y<0) { mark=1; i++; break; } flag[x][y]++; i++; if(flag[x][y]==2&&jj) { jj=0; mark=2; pos=i; } if(flag[x][y]==3) { cnt=i-pos; break; } } if(mark==1) printf("%d step(s) to exit\n",i); else if(mark==2) printf("%d step(s) before a loop of %d step(s)\n",pos-cnt,cnt); } int main() { int k; int x,y; memset(s,0,sizeof(s)); s['E']=1; s['S']=2; s['W']=3; s['N']=4; while(scanf("%d%d%d",&n,&m,&k),n+m+k) { mark=0; memset(flag,0,sizeof(flag)); for(int i=0; i<n; i++) { scanf("%s",ss[i]); } k--; y=k%m; x=k/m; if(x>n) { printf("0 step(s) to exit\n"); continue; } solve(x,y); } return 0; }按图走就好了,可恶的是忘记加‘=‘号,调试了一晚上,气死了!
相关文章推荐
- 把握linux内核设计思想(七):内核定时器和定时执行
- hdu 5317 RGCDQ (素因子个数的GCD)
- HALCON算子函数——Chapter 17 : Tools
- [HTTP那些事] JSON数据
- 求有环单链表中的环长、环起点、链表长
- spring 入门案例
- LeetCode || Path Sum
- Windows键盘快捷键
- 输油管道(北京化工网赛)
- FileZilla Server安装配置教程
- MyBatis知多少(22)MyBatis删除操作
- zoj 3735 概率dp
- Mysql或者Hive数据行变成列
- hdoj5319
- C++面试题之写一个函数找出一个整数数组中,第二大的数
- UVA-11584 Partitioning by Palindromes (简单线性DP)
- 过滤器
- HDOJ 1879 继续畅通工程(最小生成树--kruskal)
- sublime Html快捷键大全
- 7.29学习笔记字符输入输出流