杭电OJ-1035_Robot Motion
2015-07-20 18:24
369 查看
Problem 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
题意:从规定起点,按照规定方向遍历,要判断是否有环
小结: 牵一发而动全身,改个小错,改出了千奇百怪的error,
AC代码
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
Sample Output
10 step(s) to exit 3 step(s) before a loop of 8 step(s)
题意:从规定起点,按照规定方向遍历,要判断是否有环
小结: 牵一发而动全身,改个小错,改出了千奇百怪的error,
AC代码
#include<iostream> using namespace std; struct node { char dire; int count=0; }; node **n; int r, c, l,No,loop; //行,列,起点,总步数,循环步数 void ju(int h,int l) { if (n[h][l].count == 0) //环判断 { n[h][l].count = No; No++; if (n[h][l].dire == 'W'&&l - 1 >= 0) ju(h, l - 1); //方向判断 else if (n[h][l].dire == 'E'&&l + 1 < c) ju(h, l + 1); else if (n[h][l].dire == 'N'&&h - 1 >= 0) ju(h - 1, l); else if (n[h][l].dire == 'S'&&h + 1 < r) ju(h + 1, l); } else loop = n[h][l].count; } int main() { while (cin >> r >> c >> l&&r != 0 && c != 0 && l != 0) { No = 1; loop = 0; n = new node*[r]; for (int i = 0; i < r; i++) { n[i] = new node[c]; for (int j = 0; j < c; j++) { cin >> n[i][j].dire; } } ju(0,l-1); if (loop == 0) cout << No - 1 << " step(s) to exit\n"; else cout << loop - 1 << " step(s) before a loop of " << No - loop << " step(s)\n"; } }
相关文章推荐
- sql server management studio连接实例 更改 默认端口
- 联调测试
- 使用SQL*PLUS命令
- Coudera-Manager/CDH的安装和部署
- cocos2d-x 3.0 PhysicsEditor 加载plist PEShapeCache_X3_0
- poj 1930 无限小数化分数
- Apache Shiro 使用手册(一)Shiro架构介绍
- js常用函数
- js打印数组查看
- CSS - 内联元素span 强制换行失败的可能原因
- [LeetCode][Java] Recover Binary Search Tree
- Android之fragment生命周期解析
- EDB(Enterprisedb)9.4安装Product key破解
- 在jsp界面实现对表单用户名、密码不能为空的验证代码
- css+html 制作三角形
- 多线程进阶之并发工具类:CountDownLatch、CyclicBarrier
- C语言逻辑运算小程序
- 支付宝&海淘支付宝
- FC总线技术简介
- FC总线技术简介