1035
2016-01-15 22:01
351 查看
Robot Motion
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8660 Accepted Submission(s): 3987
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 <cstdio> #include <cstring> #include <iostream> #include <algorithm> #define MAXN 20 using namespace std; int n,m; char mp[MAXN][MAXN]; int kkke[MAXN][MAXN]; void work() { int x=0,y,prex,prey; scanf("%d%d",&m,&y);y--; for(int i=0;i<n;i++) { scanf("%s",mp[i]); for(int j=0;j<m;j++)kkke[i][j]=-1; } kkke[x][y]=0; while(true) { prex=x;prey=y; switch(mp[x][y]) { case 'E':y++;break; case 'W':y--;break; case 'S':x++;break; case 'N':x--;break; } if(x<0||x>=n||y<0||y>=m) { printf("%d step(s) to exit\n",kkke[prex][prey]+1); return; } if(kkke[x][y]!=-1) { printf("%d step(s) before a loop of %d step(s)\n",kkke[x][y],kkke[prex][prey]-kkke[x][y]+1); return; } kkke[x][y]=kkke[prex][prey]+1; } } int main() { freopen("input.txt","r",stdin); freopen("output.txt","w",stdout); while(scanf("%d",&n),n)work(); return 0; }
相关文章推荐
- Educational Codeforces Round 5 A. Comparing Two Long Integers
- Educational Codeforces Round 5 B. Dinner with Emma B. Dinner with Emma
- Educational Codeforces Round 5 C. The Labyrinth
- Educational Codeforces Round 5 D. Longest k-Good Segment
- 在知乎上给评论加入跳转链接--XSS练手
- MacBook外接显示器设置方法(新手入门贴)
- java加密、解密技术系列:Base64
- 网易新闻
- 针对之前的Canvas的一个小小的改版,算作canvas(二)吧
- 蓝懿IOS阶段测试
- 插入排序的一种尾递归实现-C
- UI_1
- python学习第十课续 :线程池
- linux变量篇(三) 命令行参数变量传递
- 怎样学习java?
- 开发中常见问题
- Ugly Number
- C#基础练习(时间的三连击)
- 欢迎使用CSDN-markdown编辑器
- C#基础练习(时间的三连击)