POJ-1573-Robot Motion
来源:互联网 发布:淘宝卖家客户电话 编辑:程序博客网 时间:2024/04/30 23:21
Robot Motion
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12602 Accepted: 6113
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<stdio.h>#include<string.h>#include<math.h>#include<queue>#include<algorithm>using namespace std;char Map[200][200];int Step[200][200];int main(){ int n, m, k; while(~scanf("%d%d%d", &n, &m, &k)&&(n||m||k)) { if(!n||!m) { printf("0 step(s) to exit\n"); continue; } for(int i = 0; i<n; ++i) scanf("%s",Map[i]); int step = 0; for(int i = 0; i<n; ++i) { for(int j = 0; j<m; ++j) Step[i][j] = -1; } int x = 0, y = k-1; Step[x][y] = 0; while(1) { ++step; switch(Map[x][y]) { case 'N': --x; break; case 'S': ++x; break; case 'W': --y; break; case 'E': ++y; break; } if(x<0||y<0||x>=n||y>=m) { printf("%d step(s) to exit\n", step); break; } else if(Step[x][y]!=-1) { printf("%d step(s) before a loop of %d step(s)\n", Step[x][y],step-Step[x][y]); break; } else { Step[x][y] = step; } } } 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
- stored property "text" without initial value prevents synthesized initializers
- 图像缩放算法(用过了邻近差值算法)
- 签到
- java中的Static class
- 为什么C++类定义中,数据成员不能被指定为自身类型,但可以是指向自身类型的指针或引用?
- POJ-1573-Robot Motion
- C++函数重载案例
- POJ-1905-Expanding Rods【二分】【计算几何】
- Win10配置Apache The requested operation has failed
- 不定积分表
- 第三章--自定义控件
- TabLayout标签布局+ViewPager
- Python入门笔记(5)_ 切片与迭代
- 扑克牌大小