<poj-1573>Robot Motion
来源:互联网 发布:mac系统免费办公软件 编辑:程序博客网 时间:2024/06/05 03:09
Robot Motion
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 13145 Accepted: 6372
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)
Source
应该还是个简单的模拟题吧,做了上一个题,原来觉得这个题应该很轻松的,因为有个地方没有写成else if 调了好长时间
#include<stdio.h>#include<string.h>int main(){ char map[100][100]; int visit[100][100]; int step[100][100];int n, m, k;int i, j, ii, jj;while(scanf("%d %d %d", &n, &m, &k)!=EOF){ int count = 1; memset(map, 0, sizeof(map));memset(visit,0, sizeof(visit));memset(step, 0, sizeof(step));if(n == 0&&m == 0 && k == 0)break;for(i = 0; i < n;i++) scanf("%s",&map[i]);i = 0; j = k-1;while(1)//满足条件就循环 { visit[i][j] = 1; step[i][j] = count; ii = i; jj = j; if(map[i][j] == 'N') i--; else if(map[i][j] == 'E') j++; else if(map[i][j] == 'S') i++; else if(map[i][j] == 'W') j--; count++;//记录步数 if(i>n-1 || i < 0 || j > m-1 ||j < 0 || visit[i][j] == 1) break; } if(visit[i][j] == 1)//如果是因为已经访问的输出,就是有循环 printf("%d step(s) before a loop of %d step(s)\n",step[i][j]-1, count-step[i][j]); else printf("%d step(s) to exit\n",step[ii][jj]);}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
- C++和C中的static讲解
- 数据不一致性
- 1056. Mice and Rice (25)
- 1105 第K大的数
- mysql 导出
- <poj-1573>Robot Motion
- KMP算法-next数组的含义和求法
- Android 仿支付宝支付密码输入框
- zbus
- 数据冗余
- 第三阶段-原型学习笔记
- CentOS 6.3下配置iSCSI网络存储
- DOS下mysql建表并导入excel表格
- fread 读入优化