hdu1240——Asteroids!
来源:互联网 发布:中国食品安全数据 编辑:程序博客网 时间:2024/05/08 11:08
Asteroids!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3497 Accepted Submission(s): 2312
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
Source
South Central USA 2001
Recommend
zf | We have carefully selected several similar problems for you: 1242 1072 1253 1372 1016
Statistic | Submit | Discuss | Note
图是三维的,方向多了2个,搜索还是一样的
#include<queue>#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;char str[11];int mat[15][15][15];int vis[15][15][15];int dir[6][3]={ {0, 0, -1}, {0, 0, -1}, {0, -1, 0}, {0, 1, 0}, {1, 0, 0}, {-1, 0, 0} };int n;struct node{int x,y,z;int step;};bool is_legal(int x, int y, int z){if( x < 0 || y < 0 || z < 0 || x >= n || y >= n || z >= n || vis[x][y][z] || mat[x][y][z] == 'X')return false;return true;}void bfs(int sx, int sy, int sz, int ex, int ey, int ez){queue<node>qu;bool flag = false;int ans;while( !qu.empty() )qu.pop();memset(vis,0,sizeof(vis));node temp1, temp2;temp1.x = sx;temp1.y = sy;temp1.z = sz;temp1.step = 0;qu.push(temp1);vis[temp1.x][temp1.y][temp1.z] = 1;while( !qu.empty() ){temp1 = qu.front();qu.pop();if(temp1.x == ex && temp1.y == ey && temp1.z == ez){ans = temp1.step;flag = true;break;}for(int i = 0; i < 6; i ++){temp2.x = temp1.x + dir[i][0];temp2.y = temp1.y + dir[i][1];temp2.z = temp1.z + dir[i][2];if( !is_legal(temp2.x, temp2.y, temp2.z) )continue;vis[temp2.x][temp2.y][temp2.z] = 1;temp2.step = temp1.step + 1;qu.push(temp2);}}if(flag)printf("%d %d\n", n, ans);elseprintf("NO ROUTE\n");}int main(){while(~scanf("%s%d", str, &n)){int sx, sy, sz, ex, ey, ez;for(int i = 0; i < n; i ++)for(int j = 0; j< n; j ++){scanf("%s", mat[i][j]);}scanf("%d%d%d", &sx, &sy, &sz);scanf("%d%d%d", &ex, &ey, &ez);scanf("%s",str);bfs(sx, sy, sz, ex, ey, ez);}return 0;}
0 0
- hdu1240——Asteroids!
- hdu1240——Asteroids!(广搜)
- ACM-三维BFS之Asteroids!——hdu1240
- HDU1240 Asteroids!
- hdu1240 Asteroids!
- HDU1240:Asteroids!
- hdu1240 Asteroids!
- hdu1240 Asteroids!
- HDU1240:Asteroids
- HDU1240:Asteroids!(BFS)
- hdu1240 Asteroids! (BFS)
- Asteroids!(hdu1240,dfs)
- HDU1240 Asteroids!(BFS)
- ACM 搜索 hdu1240 Asteroids!
- hdu1240 Asteroids!--DFS & BFS
- HDU1240 Asteroids!(BFS)
- BFS---HDU1240 Asteroids!
- HDU1240(BFS)Asteroids!
- 如何在ANDROID JNI 的C++中打Log
- 二叉排序树_C++实现
- ublox配置问题
- Android读取 meta_data元素的数据
- svn服务器端及客户端安装
- hdu1240——Asteroids!
- 全民赚钱官方使用手册
- C++设计模式——策略模式
- Eclipse中Android项目异常
- SqlServer常用语句参考
- 三色棋
- FPGA机器学习之机器学习的n中算法总结2
- Eclipse的使用介绍
- 所有我所收集或者工作中积累的代码以及程序等资源