【POJ】[1573]Robot Motion
2016-07-28 15:29
302 查看
Robot Motion
Time Limit: 1000MS | Memory Limit: 10000K |
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 areN 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> char map[120][120]; int cnt[120][120]; int n,m,resx,resy; bool win=false; int move(int x,int y,int mcnt) { // printf("%d-%d-%c\n",x,y,map[x][y]); if(x<0||x==n||y<0||y==m) { win=true; return mcnt-1; } if(cnt[x][y]) { win=false; resx=x; resy=y; return mcnt-1; } cnt[x][y]=mcnt; if(map[x][y]=='N') return move(x-1,y,mcnt+1); else if(map[x][y]=='S') return move(x+1,y,mcnt+1); else if(map[x][y]=='W') return move(x,y-1,mcnt+1); else if(map[x][y]=='E') return move(x,y+1,mcnt+1); } int main() { int k; while(scanf("%d %d %d",&n,&m,&k),n||m||k) { getchar(); for(int i=0; i<n; i++) { for(int j=0; j<m; j++) { cnt[i][j]=0; scanf("%c",&map[i][j]); } getchar(); } int res=move(0,k-1,1); if(win) printf("%d step(s) to exit\n",res); else printf("%d step(s) before a loop of %d step(s)\n",cnt[resx][resy]-1,res-cnt[resx][resy]+1); } return 0; }
题目地址:【POJ】[1573]Robot Motion
查看原文:http://www.boiltask.com/blog/?p=1901
相关文章推荐
- 进制转换
- 天纵智能软件快速开发平台单页编辑插件
- HttpClient使用详解(MultipartEntityBuilder 上传文件等)
- Drools 规则文件 ——语法属性
- POJ - 1979-Red and Black
- O(1)快速乘注意事项
- SPFA
- Android ServiceConnection
- zookeepeer选举master
- 权限修饰符
- 【Android基础知识】Android Studio 编译慢及 Adb connection Error:远程主机强迫关闭了一个现有的连接
- AC多模匹配算法过滤敏感词实例
- 针对域名做iptables
- C#实现字符串倒叙方法整理
- 广义线性模型.多项式分布.softmax
- NodeJS 异步变同步的方法遍历文件夹
- 最长公共子序列求解:递归与动态规划方法
- Web项目上传文件失败
- c语言和c++的输入,输出和异常
- thinkphp3.2.3 分页代码分享