Robot Motion
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)
Source
题目类型：模拟
算法分析：按照题意直接进行模拟即可。对于可以“走出去“的数据，按照地图上每一个位置所能走的下一个位置进行移动，并累加步数step，改变已访问标志。对于不能”走出去“的数据，按照地图上每一个位置所指向的下一个位置进行移动，累加总步数sumstep，改变该位置已访问的标志。当到达一个位置其标志为已访问时，记下该位置，并从起始位置计算到该位置的步数substep，最后输出为substep和sumstep-substep
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 |
#include <cstdio> #include <iostream> #include <fstream> #include <cstring> using namespace std; const int maxn = 16; char maps[maxn][maxn]; bool maps_isvisit[maxn][maxn]; int main() { int row, col, weizhi_col; //ifstream cin ("aaa.txt"); while (cin >> row >> col >> weizhi_col) { if (!row && !col && !weizhi_col) break; int i, j; memset (maps_isvisit, false, sizeof (maps_isvisit)); for (i = 0; i < row; i++) cin >> maps[i]; int weizhi_x = 0, weizhi_y = weizhi_col - 1, sumstep = 0; while (1) { if (weizhi_x < 0 || weizhi_x > row - 1 || weizhi_y < 0 || weizhi_y > col - 1 || maps_isvisit[weizhi_x][weizhi_y]) break; else { if (maps[weizhi_x][weizhi_y] == 'N') { maps_isvisit[weizhi_x][weizhi_y] = true; weizhi_x--; sumstep++; } else if (maps[weizhi_x][weizhi_y] == 'S') { maps_isvisit[weizhi_x][weizhi_y] = true; weizhi_x++; sumstep++; } else if (maps[weizhi_x][weizhi_y] == 'E') { maps_isvisit[weizhi_x][weizhi_y] = true; weizhi_y++; sumstep++; } else if (maps[weizhi_x][weizhi_y] == 'W') { maps_isvisit[weizhi_x][weizhi_y] = true; weizhi_y--; sumstep++; } } } if (weizhi_x < 0 || weizhi_x > row - 1 || weizhi_y < 0 || weizhi_y > col - 1) printf ("%d step(s) to exit\n", sumstep); else { int substep = 0, temp_x = 0, temp_y = weizhi_col - 1; while (1) { if (temp_x == weizhi_x && temp_y == weizhi_y) break; if (maps[temp_x][temp_y] == 'N') { temp_x--; substep++; } else if (maps[temp_x][temp_y] == 'S') { temp_x++; substep++; } else if (maps[temp_x][temp_y] == 'E') { temp_y++; substep++; } else if (maps[temp_x][temp_y] == 'W') { temp_y--; substep++; } } printf ("%d step(s) before a loop of %d step(s)\n", substep, sumstep - substep); } } return 0; } |
- « 上一篇：poj1562
- poj1603：下一篇 »