Robot Motion
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 11324   Accepted: 5512

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)

突然爱上了模拟题,要是所有题都像这样的题目只需模拟一下走的方向,而不考虑算法的该有多好。。。哈哈

从头开始走,记录第几步走在了哪一个格子上,如果要走的格子大于0了,说明走重复了。这题比较水。

代码:

#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#pragma warning(disable:4996)
using namespace std; enum{ E,N,W,S };
int map_f[20][20];
char call[20][20];
int move_x[5]={0,-1,0,1};
int move_y[5]={1,0,-1,0};
int X,Y,start,i,cur_x,cur_y,flag; void solve()
{
int temp; cur_x = 1;
cur_y = start;
map_f[cur_x][cur_y]=1; while(1)
{
if(flag)
break;
if(call[cur_x][cur_y]=='E')
{
temp=map_f[cur_x][cur_y];
cur_x = cur_x + move_x[E];
cur_y = cur_y + move_y[E]; if(cur_x<=0 || cur_y<=0 || cur_x>X || cur_y>Y)
{
flag=1;
cout<<temp<<" step(s) to exit"<<endl;
}
else if(map_f[cur_x][cur_y])
{
flag=1;
cout<<map_f[cur_x][cur_y]-1<<" step(s) before a loop of "<<temp-map_f[cur_x][cur_y]+1<<" step(s)"<<endl;
}
else
{
map_f[cur_x][cur_y]=temp+1;
}
}
else if(call[cur_x][cur_y]=='N')
{
temp=map_f[cur_x][cur_y];
cur_x = cur_x + move_x[N];
cur_y = cur_y + move_y[N]; if(cur_x<=0 || cur_y<=0 || cur_x>X || cur_y>Y)
{
flag=1;
cout<<temp<<" step(s) to exit"<<endl;
}
else if(map_f[cur_x][cur_y])
{
flag=1;
cout<<map_f[cur_x][cur_y]-1<<" step(s) before a loop of "<<temp-map_f[cur_x][cur_y]+1<<" step(s)"<<endl;
}
else
{
map_f[cur_x][cur_y]=temp+1;
}
}
else if(call[cur_x][cur_y]=='W')
{
temp=map_f[cur_x][cur_y];
cur_x = cur_x + move_x[W];
cur_y = cur_y + move_y[W]; if(cur_x<=0 || cur_y<=0 || cur_x>X || cur_y>Y)
{
flag=1;
cout<<temp<<" step(s) to exit"<<endl;
}
else if(map_f[cur_x][cur_y])
{
flag=1;
cout<<map_f[cur_x][cur_y]-1<<" step(s) before a loop of "<<temp-map_f[cur_x][cur_y]+1<<" step(s)"<<endl;
}
else
{
map_f[cur_x][cur_y]=temp+1;
}
}
else if(call[cur_x][cur_y]=='S')
{
temp=map_f[cur_x][cur_y];
cur_x = cur_x + move_x[S];
cur_y = cur_y + move_y[S]; if(cur_x<=0 || cur_y<=0 || cur_x>X || cur_y>Y)
{
flag=1;
cout<<temp<<" step(s) to exit"<<endl;
}
else if(map_f[cur_x][cur_y])
{
flag=1;
cout<<map_f[cur_x][cur_y]-1<<" step(s) before a loop of "<<temp-map_f[cur_x][cur_y]+1<<" step(s)"<<endl;
}
else
{
map_f[cur_x][cur_y]=temp+1;
}
}
} } int main()
{ while(cin>>X>>Y>>start)
{
if(!(X+Y+start))
break; memset(map_f,0,sizeof(map_f));
flag=0; for(i=1;i<=X;i++)
{
cin>>call[i]+1;
}
solve();
}
return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

POJ 1573:Robot Motion的更多相关文章

  1. 【POJ - 1573】Robot Motion

    -->Robot Motion 直接中文 Descriptions: 样例1 样例2 有一个N*M的区域,机器人从第一行的第几列进入,该区域全部由'N' , 'S' , 'W' , 'E' ,走 ...

  2. 模拟 POJ 1573 Robot Motion

    题目地址:http://poj.org/problem?id=1573 /* 题意:给定地图和起始位置,robot(上下左右)一步一步去走,问走出地图的步数 如果是死循环,输出走进死循环之前的步数和死 ...

  3. POJ 1573 Robot Motion(BFS)

    Robot Motion Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 12856   Accepted: 6240 Des ...

  4. Poj OpenJudge 百练 1573 Robot Motion

    1.Link: http://poj.org/problem?id=1573 http://bailian.openjudge.cn/practice/1573/ 2.Content: Robot M ...

  5. POJ 1573 Robot Motion(模拟)

    题目代号:POJ 1573 题目链接:http://poj.org/problem?id=1573 Language: Default Robot Motion Time Limit: 1000MS ...

  6. Robot Motion 分类: POJ 2015-06-29 13:45 11人阅读 评论(0) 收藏

    Robot Motion Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 11262 Accepted: 5482 Descrip ...

  7. POJ 1573 Robot Motion

    Robot Motion Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 12978   Accepted: 6290 Des ...

  8. poj 1573 Robot Motion【模拟题 写个while循环一直到机器人跳出来】

                                                                                                         ...

  9. poj1573 Robot Motion

    Robot Motion Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 12507   Accepted: 6070 Des ...

随机推荐

  1. Unity ShaderLab 学习笔记(一)

    因为项目的问题,有个效果在iOS上面无法实现出来- 因为shader用的HardSurface的,在android上面跑起来没有问题- 以为在iOS上也不会有问题,但是悲剧啊,技能效果一片漆黑- 而且 ...

  2. sklearn中调用PCA算法

    sklearn中调用PCA算法 PCA算法是一种数据降维的方法,它可以对于数据进行维度降低,实现提高数据计算和训练的效率,而不丢失数据的重要信息,其sklearn中调用PCA算法的具体操作和代码如下所 ...

  3. javac导出参考文档报错 错误: 编码GBK的不可映射字符”

  4. 个人项目发表到GitHub

    个人项目源程序代码发送到github上. 因为之前假期已经注册过了账户,所以只是上传了做过的小账本项目. https://www.cnblogs.com/sdcs/p/8270029.html

  5. docker-jenkins SSH Publishers时踩的坑

    source相对路径问题,不是 /var/jenkins_home/workspace/build-renren/target/renren-fast.war  或环境变量,而是  target/re ...

  6. arm linux 移植 python3.6

    背景: 人生苦短,我用Python. 说明: 编译Python的嵌入式版需要解释器解析setup.py从而编译Python的模块,因此需要先编译出host的解释器.(有点像Go语言) Python : ...

  7. 51nod 1391:01串

    1391 01串 题目来源: Codility 基准时间限制:1 秒 空间限制:131072 KB 分值: 40 难度:4级算法题  收藏  关注 给定一个01串S,求出它的一个尽可能长的子串S[i. ...

  8. $('#myModal').modal('show') //显示$('#myModal').modal('hide')隐藏

    你这样试试,这是官方文档的写法 $('#myModal').modal('show') //显示$('#myModal').modal('hide')隐藏 //重复点击的隐藏显示有一个很更方便的写法$ ...

  9. Unix-Time

    1. Unix_time 2. Year_2000_problem 3. Year_10,000_problem 4. Year_2038_problem 5. Time_formatting_and ...

  10. bzoj 4652: [Noi2016]循环之美

    额,,网上一堆题解,,随便一找就找到笨蒟蒻扒的了. 这个比较神奇的是纯循环小数就是[(y,k)=1],题解有证明这个的,貌似就是k进制下的类似循环节,不会不会.. 然后这道题就变成了求这个东西:∑(x ...