poj 2225 Asteroids!【BFS】

原创 2015年11月20日 20:11:30
Asteroids!
Time Limit: 1000MS   Memory Limit: 65536K
Total Submissions: 3087   Accepted: 1161

Description

You're in space. 
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: 
  1. Start line - A single line, "START N", where 1 <= N <= 10. 
  2. 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
  3. 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. 
  4. 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. 
  5. 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. 

Sample Input

START 1
O
0 0 0
0 0 0
END
START 3
XXX
XXX
XXX
OOO
OOO
OOO
XXX
XXX
XXX
0 0 1
2 2 1
END
START 5
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
XXXXX
XXXXX
XXXXX
XXXXX
XXXXX
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
OOOOO
0 0 0
4 4 4
END

Sample Output

1 0
3 4
NO ROUTE

三维广搜搜索

给一个三维空间的规格n * n * n;

给出空间中的结构,然后给两个坐标,问能不能从一个坐标走到另一个坐标,如果能,输出三维空间的规模n和要走的最少步数,如果不能,直接输出“NO ROUTE”.

注意:最后输入的坐标顺序是(c, b, a),

已Accept代码【c++提交】

#include <cstring>
#include <cstdio>
#include <queue>
using namespace std;

int dx[] = {1, -1, 0, 0, 0, 0};
int dy[] = {0, 0, 1, -1, 0, 0};
int dz[] = {0, 0, 0, 0, 1, -1};
char str[5];
char s, ss[4];
int n;
int x, y, z;
int a, b, c;
bool map[11][11][11];//用bool型,节约空间【自己想想为什么】
int dis[11][11][11];
struct node {
	int x, y, z;
	node() {}
	node(int x, int y, int z) : x(x), y(y), z(z) {}
};

void BFS() {
	queue <node> Q;
	memset(dis, 0x3f3f3f, sizeof(dis));
	Q.push(node(a, b, c)) ;
	dis[a][b][c] = 0;
	while(!Q.empty()) {
		node tmp = Q.front();
		Q.pop();
		int nx = tmp.x;
		int ny = tmp.y;
		int nz = tmp.z;
		for(int i = 0; i < 6; i++) {
			int sx = nx + dx[i];
			int sy = ny + dy[i];
			int sz = nz + dz[i];
			if(sx < 0 || sx >= n || sy < 0 || sy >= n || sz < 0 || sz >= n || map[sx][sy][sz] == true)
				continue;
			if(dis[sx][sy][sz] > dis[nx][ny][nz] + 1) {
				dis[sx][sy][sz] = dis[nx][ny][nz] + 1;
				Q.push(node(sx, sy, sz));
			}
		}
	}
	if(dis[x][y][z] > 1000)
		printf("NO ROUTE\n");
	else
		printf("%d %d\n", n, dis[x][y][z]);
}

int main() {
	while(scanf("%s%d", str, &n) != EOF) {
		for(int i = 0; i < n; i++)
			for(int j = 0; j < n; j++) {
				getchar();
				for(int k = 0; k < n; k++) {
					scanf("%c", &s);
					if(s == 'O')
						map[i][j][k] = false;
					else
						map[i][j][k] = true;
				}
			}
		scanf("%d%d%d", &c, &b, &a);
		scanf("%d%d%d", &z, &y, &x);
		scanf("%s", ss);
		BFS();
	}
	return 0;
}

版权声明:本文为博主原创文章,转载请注明出处,谢谢。

POJ2225 Asteroids! (三维的BFS求最短路)

 Asteroids! Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 3017   ...

hdu 1240 poj 2225 Asteroids! 三维bfs 解题报告

Asteroids! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Tot...

HDU 2225 Asteroids!(三维BFS)

Asteroids! Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Desc...

zoj 1438 || poj 2225 Asteroids!

啊 崩溃。 一看是三维广搜,觉得挺简单的,就做了。 一直WA,去看poj讨论,发现人家说,输入的是列,行,层。。。悲剧了。。。输入错了 = =。。。 都是不好好看题啊不好好看题。。。无语。。。 #in...

【二分图|最大匹配】POJ-3041 Asteroids(匈牙利算法dfs、bfs版)

Asteroids Time Limit: 1000MS   Memory Limit: 65536K       Description Bessie wants to nav...

poj 2225 三维空间宽度遍历

题目大意:给定一个三维的空间,还有起点和终点坐标,要你求到终点的最短距离 解题思路:最短距离用宽度优先遍历,分别考虑上下,左右,前后6个方向。题目很简单,就是要注意下坐标顺序 #include ...

【原创】KM算法 ※HDU 2225 POJ 2195

KM算法KM是适用于二分图的算法,如果不清楚,可以查看这篇博客。完美匹配与完备匹配与最佳匹配完美匹配一个二分图中,如果X部和Y部的顶点数相同,存在一个匹配,包含所有顶点,则称这个匹配为完美匹配。 如...

POJ3026-Borg Maze【BFS+Prim】

  • 2011年07月30日 18:36
  • 12KB
  • 下载

hdu 1240 Asteroids! (三维bfs)

Asteroids! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Tot...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:poj 2225 Asteroids!【BFS】
举报原因:
原因补充:

(最多只允许输入30个字)