poj 1573 Robot Motion
来源:互联网 发布:mysql 5.6参考手册 编辑:程序博客网 时间:2024/05/29 14: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 <iostream>#include <cstring>#include <cstdio>#include <queue>using namespace std;char str[110][110];int Map[110][110];int n,m,k;int px,py;int Step;int Dir[][2] = {{-1,0},{0,1},{1,0},{0,-1}};struct node{ int x,y;};int Driection(char ch){ switch(ch) { case 'N': return 0; case 'E': return 1; case 'S': return 2; case 'W': return 3; default : return -1; }}void Run(int x,int y){ memset(Map,0,sizeof(Map)); Step = 0; queue<node>que; node b,c; b.x = x; b.y = y; que.push(b); int st,ed; int flag = false; while(!que.empty()) { Step++; b = que.front(); que.pop(); Map[b.x][b.y]++; if(b.x < 0 || b.x >= n || b.y < 0 || b.y >= m) { printf("%d step(s) to exit\n",Step-1); return ; } if(Map[b.x][b.y] == 2 && !flag) { flag = true; st = Step; } if(Map[b.x][b.y] == 3) { ed = Step - st; printf("%d step(s) before a loop of %d step(s)\n",st-ed-1,ed); return ; } int d = Driection(str[b.x][b.y]); c.x = b.x + Dir[d][0]; c.y = b.y + Dir[d][1]; que.push(c); }}int main(){ //freopen("in.txt","r",stdin); while(cin>>n>>m>>k) { if(n == 0 && m == 0 && k == 0) break; for(int i=0; i<n; i++) { cin>>str[i]; } Run(0,k-1); } return 0;}
0 0
- 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
- Robot Motion POJ 1573
- VC学习笔记7文件操作
- Java中的for循环
- 第一篇文章 记学习iOS
- 如何实现EditPlus、UE等工具的列选择,并且将选择的列复制到word中的表格
- 嵌入式软件开发——嵌入式软件工程师应聘知识点
- poj 1573 Robot Motion
- codeblocks一些快捷操作
- linux shell man命令详细介绍-快捷获得帮助信息(2)
- Java的垃圾回收总结
- poj 1390 dp(方盒游戏)
- 暑假集训第三周周三赛 STL C - Strange Class 字符相同 SC数
- Java07—30
- PULL解析XML的运行机制详解
- 数据库MySQL基础——增删查改