Robot Motion(模拟法)
来源:互联网 发布:excel2007编程实例vb 编辑:程序博客网 时间:2024/06/07 21:03
Language:
Robot Motion
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 13093 Accepted: 6342
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 5NEESWEWWWESSSNWWWW4 5 1SESWEEESNWNWEENEWSEN0 0 0
Sample Output
10 step(s) to exit3 step(s) before a loop of 8 step(s)
Source
分析:模拟机器人在矩阵走,如果某个方格经过了两次,说明进入了死循环
#include <iostream>#include <cstdio>#include <cstring>using namespace std;int main(){ int n,m,s,i,j,k; int v[20][20]; char a[20][20]; while(scanf("%d%d%d",&n,&m,&s)!=EOF) { if(n==0&&m==0&&s==0) break; memset(v,0,sizeof(v)); for(i=1;i<=n;i++) for(j=1;j<=m;j++) { cin>>a[i][j]; } i=1;j=s;k=0; int flag=1; while(i>=1&&i<=n&&j<=m&&j>=1) { k++; if(v[i][j])//已走过一次再走到这儿便是循环 { flag=0; break; } else { v[i][j]=k; if(a[i][j]=='N') i--; else if(a[i][j]=='E') j++; else if(a[i][j]=='S') i++; else if(a[i][j]=='W') j--; } } if(flag==1) cout<<k<<" step(s) to exit"<<endl; else cout<<v[i][j]-1<<" step(s) before a loop of "<<k-v[i][j]<<" step(s)"<<endl;//走入死循环前的步数第一圈死循环不算步数 一圈死循环所需的步数 } return 0;}
0 0
- Robot Motion(模拟法)
- hdu1035 Robot Motion 模拟
- POJ1573--模拟--Robot Motion
- Robot Motion (模拟题)
- poj1573 Robot Motion (模拟)
- HDOJ1035 Robot Motion 【模拟】
- POJ1573 Robot Motion(模拟)
- poj1573 Robot Motion 模拟
- POJ 1573 Robot Motion模拟
- POJ 1573 Robot Motion 模拟
- POJ1573《Robot Motion》方法:模拟
- POJ 1573 Robot Motion 模拟
- POJ 1573 Robot Motion 模拟
- poj Robot Motion(模拟)
- hdu 1035 Robot Motion(模拟)
- POJ 1573-Robot Motion(模拟)
- POJ1573 Robot Motion 模拟题
- poj-1573-Robot Motion--模拟
- 数据库学习
- hadoop 2.7.1 高可用安装部署
- float x 与“零值”比较
- Leetcode 400. Nth Digit[easy]
- 深入理解Java:注解(Annotation)自定义注解入门
- Robot Motion(模拟法)
- ios 开发 NSString 正确遍历字符个数方式 (surrogate pairs)
- webuploader解决不能重复上传问题
- 若有x = 1,y = 2, z = 3,则表达式(x<y?x:y)==z++的值?
- FreeRTOS代码剖析之5:链表管理list.c
- centos下安装jdk后,出现该错误cannot execute binary file
- 原迹手写之贝赛尔曲线(穿过已知点画平滑曲线(3次贝塞尔曲线)
- Android selector 状态选择器
- 线性代数基础课1-1