Robot Motion
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
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)
题目不难,可是容易出错!千万细心!
现在贴代码!
#include<iostream>
#include<string>
#include<cstdio>
using namespace std;
const int SIZE=100;
int step[4][2]={0,-1, 1,0, 0,1, -1,0};
int main()
{
string str[SIZE];
char flag;
int row,line,place;
int loop;
int i,m,n,k;
int p,q;
while(scanf("%d%d%d",&row,&line,&place))//行列
{
if(row==0 && line==0 && place==0) break;
for(i=0;i<row;i++)
{
cin>>str[i];
}
flag=str[0][place-1];
m=0; n=place-1; k=0;
loop=0;
while(0<=m && m<row && 0<=n && n<line)
{
p=m;q=n;
flag=str[m][n];//取得该处的值
if(flag!='E' && flag!='W' && flag!='S' && flag!='N')
{
loop=1;
break;
}//不为这四点说明循环!就退出!
str[m][n]=1+k;
k++;
switch(flag)
{
case 'N':m=m+step[0][1];n=n+step[0][0]; break;
case 'E':m=m+step[1][1];n=n+step[1][0]; break;
case 'S':m=m+step[2][1];n=n+step[2][0]; break;
case 'W':m=m+step[3][1];n=n+step[3][0]; break;
}
}
if(loop)
printf("%d step(s) before a loop of %d step(s)\n",str[m][n]-1,k+1-str[p][q]);
else
printf("%d step(s) to exit\n",str[p][q]);
}
return 0;
}
分享到:
相关推荐
杭电oj1000题解题报告
杭电OJ题目分类的叙述,可以方便去学习去做。
杭电OJ 2028代码 the rosolve of the hdu 2028
杭电OJ(1000-1099) AC 代码
本资源主要提供了杭电oj题目分类和自测状况两大类 可实现随机选题等功能.
杭电OJ部分威士忌的代码 杭电OJ部分威士忌的代码杭电OJ部分威士忌的代码
杭电oj上的一些疑问,适用于初学者,可以解答一些疑问 都是一些水题
杭电oj 1047习题
杭电oj分类
杭州电子科技大学 oj离线版
这是HDUOJ上面的140道题目的答案,其中大部分都是简单题,有些太简单的就没有收集进去,代码为C/C++,全都AC了的,其中有些有具体的说明是怎么做的,例如博弈论那些
课程资源 杭电OJ1000-1099答案 ,仅供参考...
杭电oj的离线版以及题目分类的文档 更加一目了然 方便选择适合的题目做 适合暂时上不了网的用于练习
这是杭电OJ上某些题的解题报告,后续还有上传很多!
基于Laravel 5.0的OJ题解网站 , 目前涵盖安科OJ,南阳OJ,杭电OJ ,北大OJ,浙大OJ.zip
杭电oj1048答案,c++代码,适合初学者,思路简单
这是杭电oj入门100题的题号,通过这100题可以掌握基本输入输出操作,及基本算法
杭电ACM2000-2011题已提交的代码!保证正确!