POJ 1573 Robot Motion 搜索
来源:互联网 发布:神经网络算法入门书籍 编辑:程序博客网 时间:2024/05/01 21:09
Robot Motion
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6297 Accepted Submission(s): 2952
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)
#include<iostream>#include<cstring>using namespace std;char ch[105][105];int ans;int v[105][105],w[105][105];int a,b,c,t;void dfs(int x,int y){if(t==1) return ;v[x][y]=1;ans++;if(ch[x][y]=='N') x-=1;else if(ch[x][y]=='E') y+=1;else if(ch[x][y]=='S') x+=1;else if(ch[x][y]=='W') y-=1;if(x<0||y<0||x>=a||y>=b){t=1;printf("%d step(s) to exit\n",ans);return ;}else if(v[x][y]){t=1;printf("%d step(s) before a loop of %d step(s)\n",w[x][y],ans-w[x][y]);return ;}w[x][y]=ans;if(!v[x][y])dfs(x,y);}int main(){while(cin>>a>>b>>c){if(a==0||b==0||c==0) break;t=0;int i,j;for(i=0;i<a;i++)scanf("%s",ch[i]);memset(v,0,sizeof(v));ans=0;for(i=0;i<a;i++)for(j=0;j<b;j++){if(j==c-1){dfs(i,j);}}}return 0;}
0 0
- POJ 1573 Robot Motion 搜索
- poj 1573 Robot Motion
- Poj 1573 Robot Motion
- poj 1573 Robot Motion
- POJ 1573 - Robot Motion
- poj-1573-Robot Motion
- POJ 1573 Robot Motion
- POJ 1573 Robot Motion
- POJ-1573-Robot Motion
- poj 1573 Robot Motion
- POJ 1573 Robot Motion
- POJ 1573 Robot Motion.
- poj 1573 Robot Motion
- POJ -1573 Robot Motion
- POJ 1573:Robot Motion
- poj 1573 Robot Motion
- poj 1573 Robot Motion
- POJ 1573 Robot Motion
- 有了无线网卡驱动,但总是安装不成功的解决办法
- 路由器端口映射
- Vs2013编译Boost asio时出现的错误
- poj 2244 Eeny Meeny Moo 约瑟夫环
- sizeof memset strlen 几个常见小错误 小结
- POJ 1573 Robot Motion 搜索
- 无向图的割顶和桥、无向图的双连通分量、有向图的强连通分量
- 10 款最好的远程桌面软件
- 黑马程序员Java学习日记(4)集合(一)
- C++的const
- 命名实体识别NER
- yum修改为本地源
- 杭电 2034 人见人爱A-B
- 设计模式学习笔记——解释器模式