poj 1573
2016-05-12 20:36
411 查看
Robot Motion
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
Sample Output
分析:模拟题,很水
code:
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 12256 | Accepted: 5937 |
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)
分析:模拟题,很水
code:
#include <cstdio> #include <cstring> #include <iostream> #include <algorithm> using namespace std; typedef long long ll; ll n, m, Sy, vis[1005][1005]; char grid[1005][1005]; void init() { memset(grid, 0, sizeof grid); memset(vis, 0, sizeof vis); for (ll i = 1; i <= n; i++) scanf("%s", grid[i] + 1); } void solve() { ll choice = -1, cnt = 0; ll x = 1, y = Sy; vis[x][y] = 1; while (true) { switch (grid[x][y]) { case 'N': { x--; cnt++; if (x < 1) { printf("%lld step(s) to exit\n", cnt); return; } else { if (!vis[x][y]) { vis[x][y] = vis[x + 1][y] + 1; } else { vis[x][y]--; ll temp = cnt - vis[x][y]; printf("%lld step(s) before a loop of %lld step(s)\n", vis[x][y], temp); return; } } break; } case 'S': { x++; cnt++; if (x > n) { printf("%lld step(s) to exit\n", cnt); return; } else { if (!vis[x][y]) { vis[x][y] = vis[x - 1][y] + 1; } else { vis[x][y]--; ll temp = cnt - vis[x][y]; printf("%lld step(s) before a loop of %lld step(s)\n", vis[x][y], temp); return; } } break; } case 'E': { y++; cnt++; if (y > m) { printf("%lld step(s) to exit\n", cnt); return; } else { if (!vis[x][y]) { vis[x][y] = vis[x][y - 1] + 1; } else { vis[x][y]--; ll temp = cnt - vis[x][y]; printf("%lld step(s) before a loop of %lld step(s)\n", vis[x][y], temp); return; } } break; } case 'W': { y--; cnt++; if (y < 1) { printf("%lld step(s) to exit\n", cnt); return; } else { if (!vis[x][y]) { vis[x][y] = vis[x][y + 1] + 1; } else { vis[x][y]--; ll temp = cnt - vis[x][y]; printf("%lld step(s) before a loop of %lld step(s)\n", vis[x][y], temp); return; } } break; } } } } int main(void) { while (cin >> n >> m >> Sy) { if (n + m + Sy == 0) return 0; init(); solve(); } }
相关文章推荐
- 编程珠玑:位图法排序
- JNI
- Oracle 死锁的检测查询及处理
- 在Kaggle手写数字数据集上使用Spark MLlib的RandomForest进行手写数字识别
- 面试题 1
- 实验三进程调度
- 第06篇 MEF部件的生命周期(PartCreationPolicy)
- linux相关
- Linux基础之:curl工具的使用
- delphi概念性学习(三)
- python datetime模块详解
- 简单的cp程序
- C++ 类的静态成员详细讲解
- Max Sum
- IO流的读写操作
- 多重背包问题II
- JBoss调用Webservice出现org.jboss.ws.core.jaxws.spi.ProviderImple not found错误
- Linux 设备驱动框架
- 会计眼中的“借”“贷”
- LDA