Robot Motion - poj 1573
2024-09-04 01:25:34
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 11269 | Accepted: 5486 |
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 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)
#include <iostream>
#include<string.h>
using namespace std; int main() {
int row,col,x,y; int pos[][];
char ins[][];
int step;
int flag=-;
cin>>row>>col>>x;
while(row&&col&&x){
memset(pos,,sizeof(int)*);
y=;
step=;
flag=-;
for(int i=;i<row;i++){
for(int j=;j<col;j++){
cin>>ins[i][j];
}
}
pos[y-][x-]=;
for(int i=;i<row*col;i++){
switch(ins[y-][x-]){
case 'N':
y--;
break;
case 'E':
x++;
break;
case 'S':
y++;
break;
case 'W':
x--;
break;
} if(y>row||y<||x>col||x<){
flag=;
break;
}else if(pos[y-][x-]!=){
flag=;
break;
}else{
++step;
pos[y-][x-]=step;
} }
if(flag==){
cout<<step<<" step(s) to exit"<<endl;
}else{
cout<<(pos[y-][x-]-)<<" step(s) before a loop of "<<(step-pos[y-][x-]+)<<" step(s)"<<endl;
}
cin>>row>>col>>x;
}
return ;
}
最新文章
- 【实战Java高并发程序设计 2】无锁的对象引用:AtomicReference
- uva 213 Message Decoding
- 浅谈JavaScript eval() 函数
- CALayer总结(三)
- IE7局部滚动区域下绝对定位或相对定位元素不随滚动条滚动的bug
- 【Java】PrettyTime
- asp.net mvc @RenderBody()的问题
- Linux --->; 简单socket
- (转)innodb 与 myisam 读写性能分析
- 有二级目录的IIS配置
- Scheme-CPS
- WPF类层次结构
- 9 Python+Selenium鼠标事件
- C语言解决约瑟夫问题详解的代码
- MyBatis-Cache
- bzoj2683&;&;bzoj4066
- 转--python 面试题
- C语言程序设计II—第一周教学
- EJB3 阶段总结+一个EJB3案例 (2)
- 如何在虚拟机安装的Win10系统里快速打开【此电脑】图标?(图文详解)
热门文章
- Closest Binary Search Tree Value -- LeetCode
- String&;&;StringBuilder&;&;StringBuffer
- 来自Jakob Jenkov的Jackson教程
- XCode工程内多Targets教程
- System.InvalidOperationException异常
- sharepoint2010新建网站与网站集
- JAVA常见算法题(二十二)
- [置顶]
 docker1.12--docker命令行帮助文档
- 微博(MicroBlog)
- python 常用系统参数