ACM 搜索 hdu1240 Asteroids!
来源:互联网 发布:linux查看文件多大命令 编辑:程序博客网 时间:2024/05/16 09:17
Problem Description
You're in space.
You want to get home.
There are asteroids.
You don't want to hit them.
You want to get home.
There are asteroids.
You don't want to hit them.
Input
Input to this problem will consist of a (non-empty) series of up to 100 data sets. Each data set will be formatted according to the following description, and there will be no blank lines separating data sets.
A single data set has 5 components:
Start line - A single line, "START N", where 1 <= N <= 10.
Slice list - A series of N slices. Each slice is an N x N matrix representing a horizontal slice through the asteroid field. Each position in the matrix will be one of two values:
'O' - (the letter "oh") Empty space
'X' - (upper-case) Asteroid present
Starting Position - A single line, "A B C", denoting the <A,B,C> coordinates of your craft's starting position. The coordinate values will be integers separated by individual spaces.
Target Position - A single line, "D E F", denoting the <D,E,F> coordinates of your target's position. The coordinate values will be integers separated by individual spaces.
End line - A single line, "END"
The origin of the coordinate system is <0,0,0>. Therefore, each component of each coordinate vector will be an integer between 0 and N-1, inclusive.
The first coordinate in a set indicates the column. Left column = 0.
The second coordinate in a set indicates the row. Top row = 0.
The third coordinate in a set indicates the slice. First slice = 0.
Both the Starting Position and the Target Position will be in empty space.
A single data set has 5 components:
Start line - A single line, "START N", where 1 <= N <= 10.
Slice list - A series of N slices. Each slice is an N x N matrix representing a horizontal slice through the asteroid field. Each position in the matrix will be one of two values:
'O' - (the letter "oh") Empty space
'X' - (upper-case) Asteroid present
Starting Position - A single line, "A B C", denoting the <A,B,C> coordinates of your craft's starting position. The coordinate values will be integers separated by individual spaces.
Target Position - A single line, "D E F", denoting the <D,E,F> coordinates of your target's position. The coordinate values will be integers separated by individual spaces.
End line - A single line, "END"
The origin of the coordinate system is <0,0,0>. Therefore, each component of each coordinate vector will be an integer between 0 and N-1, inclusive.
The first coordinate in a set indicates the column. Left column = 0.
The second coordinate in a set indicates the row. Top row = 0.
The third coordinate in a set indicates the slice. First slice = 0.
Both the Starting Position and the Target Position will be in empty space.
Output
For each data set, there will be exactly one output set, and there will be no blank lines separating output sets.
A single output set consists of a single line. If a route exists, the line will be in the format "X Y", where X is the same as N from the corresponding input data set and Y is the least number of moves necessary to get your ship from the starting position to the target position. If there is no route from the starting position to the target position, the line will be "NO ROUTE" instead.
A move can only be in one of the six basic directions: up, down, left, right, forward, back. Phrased more precisely, a move will either increment or decrement a single component of your current position vector by 1.
A single output set consists of a single line. If a route exists, the line will be in the format "X Y", where X is the same as N from the corresponding input data set and Y is the least number of moves necessary to get your ship from the starting position to the target position. If there is no route from the starting position to the target position, the line will be "NO ROUTE" instead.
A move can only be in one of the six basic directions: up, down, left, right, forward, back. Phrased more precisely, a move will either increment or decrement a single component of your current position vector by 1.
Sample Input
START 1O0 0 00 0 0ENDSTART 3XXXXXXXXXOOOOOOOOOXXXXXXXXX0 0 12 2 1ENDSTART 5OOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOXXXXXXXXXXXXXXXXXXXXXXXXXOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO0 0 04 4 4END
Sample Output
1 03 4NO ROUTE
这是一道典型的BFS题目,这次的迷宫是一个三维空间!O为空地,X为墙壁。 可移动方向从4个变成了6个(多出了上下)仅此而已。 求从出发点到终点的步数。
- #include <string.h>
- #include <stdio.h>
- #include <queue>
- using namespace std;
- char map[20][20][20];
- int vis[20][20][20];
- int n;
- int sx,sy,sz;
- int ex,ey,ez;
- int tx[] = {1,-1,0,0,0,0};
- int ty[] = {0,0,1,-1,0,0};
- int tz[] = {0,0,0,0,1,-1};
- struct node
- {
- int x,y,z,step;
- };
- int check(int x,int y,int z)
- {
- if(x<0 || y<0 || z<0 || x>=n || y>=n || z>=n || vis[x][y][z] )
- return 0;
- return 1;
- }
- int bfs(int x,int y,int z)
- {
- int i;
- queue<node> Q;
- node a,next;
- a.x = x;
- a.y = y;
- a.z = z;
- a.step = 0;
- vis[x][y][z] = 1;
- Q.push(a);
- while(!Q.empty())
- {
- a = Q.front();
- Q.pop();
- if(a.x == ex && a.y == ey && a.z == ez)
- return a.step;
- for(i = 0;i<6;i++)
- {
- next = a;
- next.x+=tx[i];
- next.y+=ty[i];
- next.z+=tz[i];
- if(check(next.x,next.y,next.z))
- {
- next.step++;
- vis[next.x][next.y][next.z] = 1;
- Q.push(next);
- }
- }
- }
- return -1;
- }
- int main()
- {
- char s[10];
- int i,j,k;
- while(~scanf("%s%d",s,&n))
- {
- for(i = 0;i<n;i++)
- for(j = 0;j<n;j++)
- scanf("%s",map[i][j]);
- scanf("%d%d%d%d%d%d",&sx,&sy,&sz,&ex,&ey,&ez);
- scanf("%s",s);
- int ans = bfs(sx,sy,sz);
- if(ans>=0)
- printf("%d %d\n",n,ans);
- else
- printf("NO ROUTE\n");
- }
- return 0;
- }
0 0
- ACM 搜索 hdu1240 Asteroids!
- Hdu1240 - Asteroids! - 广度优先搜索
- HDU1240 Asteroids!
- hdu1240 Asteroids!
- HDU1240:Asteroids!
- hdu1240 Asteroids!
- hdu1240 Asteroids!
- HDU1240:Asteroids
- ACM-三维BFS之Asteroids!——hdu1240
- HDU1240:Asteroids!(BFS)
- hdu1240 Asteroids! (BFS)
- Asteroids!(hdu1240,dfs)
- hdu1240——Asteroids!
- HDU1240 Asteroids!(BFS)
- hdu1240 Asteroids!--DFS & BFS
- HDU1240 Asteroids!(BFS)
- BFS---HDU1240 Asteroids!
- HDU1240(BFS)Asteroids!
- java-反射初学(1)
- 单源最短路Dijkstra
- Electron.js折腾记(一):getStart
- LeetCode刷题之旅(8)
- hdu 5677-ztr loves substring
- ACM 搜索 hdu1240 Asteroids!
- 判断有向图是否有环
- java中包及修饰符的研究与应用
- 线段树
- JAVA字符串格式化-String.format()的使用总结
- jvm中分代垃圾回收和触发垃圾回收
- 拉低程序员社会地位的十大因素
- Move Zeroes
- java-反射初学(2)