HDU 1035 模拟
来源:互联网 发布:ubuntu google输入法 编辑:程序博客网 时间:2024/06/05 16:26
HDU 1035
Robot Motion
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9393 Accepted Submission(s): 4328
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 5NEESWEWWWESSSNWWWW4 5 1SESWEEESNWNWEENEWSEN0 0
Sample Output
10 step(s) to exit3 step(s) before a loop of 8 step(s)
Source
Mid-Central USA 1999
Recommend
We have carefully selected several similar problems for you: 1016 1010 2553 1258 1045
#include <iostream>#include <cstring>#include <cstdio>using namespace std;int main(){ int n,m,s; char a[205][205]; int b[205][205]; while(cin>>n>>m) { getchar(); if(n==0&&m==0) break; else cin>>s; getchar(); memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) scanf("%c",&a[i][j]); getchar(); } int i=1; int j=s; int sum=0; while(1) { if(i==0||i>n||j==0||j>m) { cout<<sum<<" step(s) to exit"<<endl; break; } if(b[i][j]!=0) { cout<<b[i][j]-1<<" step(s) before a loop of "<<sum-b[i][j]+1<<" step(s)"<<endl; break; } else{ if(a[i][j]=='N'){ b[i][j]=++sum; i--; } else if(a[i][j]=='S'){ b[i][j]=++sum; i++; } else if(a[i][j]=='E'){ b[i][j]=++sum; j++; } else{ b[i][j]=++sum; j--; } } } }}
0 0
- HDU-1035 模拟
- HDU 1035 模拟
- hdu 1035 Robot Motion(模拟)
- HDU 1035 Robot Motion 模拟
- HDU 1035 (简单模拟)
- hdu 1035很简单的一个模拟
- HDU 1035 Robot Motion(大模拟)
- HDU 1035--Robot Motion(模拟)
- HDU 1035 机器人行走步数 (模拟)
- HDU 1035 && poj 1573 Robot Motion【模拟】
- HDU 1035 Robot Motion (模拟)
- HDU 1035 Robot Motion(水题,模拟)
- 【几何模拟】hdu 3286
- hdu 1020 Encoding(模拟)
- hdu 1303 Doubles(模拟)
- hdu 4020 模拟
- HDU **** 暴力模拟
- HDU 4068 模拟
- MapReduce计数器
- Shell Script函数
- 计数排序
- linux 监控线程命令
- 基于KNN算法的约会网站配对效果 python3.2
- HDU 1035 模拟
- post 提交 和 get 提交的区别 文件上传
- Light OJ 1008 Fibsieve`s Fantabulous Birthday(找出数字位置)
- java实现递归快排和非递归快排
- SpringMVC中的java.lang.ClassNotFoundException: org.aspectj.weaver.BCException 调试过程记录
- 数组函数整理
- Hibernate实现步骤
- CentOS7 linux kill 命令
- 51 nod 1267 4个数的和为0