HDOJ 1240 Asteroids! 【BFS+优先队列】
来源:互联网 发布:怎样开淘宝网店需要多少钱 编辑:程序博客网 时间:2024/04/30 14:42
Asteroids!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3753 Accepted Submission(s): 2481
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:注意getchar()的使用
#include<stdio.h>#include<queue>using namespace std;char map[10][10][10];int startx,starty,startz,endx,endy,endz;int n;struct node{ int x,y,z,step; friend bool operator <(node a,node b) { return a.step>b.step; }};void bfs(int x1,int y1,int z1,int x2,int y2,int z2){ int k; int move[6][3]={0,0,1,0,0,-1,0,1,0,0,-1,0,1,0,0,-1,0,0}; node now,next; priority_queue<node>q; now.x=x1; now.y=y1; now.z=z1; now.step=0; map[now.x][now.y][now.z]='X'; q.push(now); while(!q.empty()) { next=q.top(); q.pop(); if(next.x==x2&&next.y==y2&&next.z==z2) { printf("%d %d\n",n,next.step); return ; } for(k=0;k<6;k++) { now.x=next.x+move[k][0]; now.y=next.y+move[k][1]; now.z=next.z+move[k][2]; if(now.x>=0&&now.x<n&&now.y>=0&&now.y<n&&now.z>=0&&now.z<n&&map[now.x][now.y][now.z]=='O') { now.step=next.step+1; map[now.x][now.y][now.z]='X'; q.push(now); } } } printf("NO ROUTE\n");}int main(){ int i,j,k; char s[10]; char c; while(scanf("%s %d",s,&n)!=EOF) { c=getchar(); for(i=0;i<n;i++) { for(j=0;j<n;j++) { for(k=0;k<n;k++) { scanf("%c",&map[i][j][k]); } c=getchar(); } c=getchar(); } scanf("%d%d%d%d%d%d",&startx,&starty,&startz,&endx,&endy,&endz); scanf("%s",s); bfs(startx,starty,startz,endx,endy,endz); } return 0;}
0 0
- HDOJ 1240 Asteroids! 【BFS+优先队列】
- BFS--- HDU 1240 Asteroids! 广度优先搜索
- hdoj - 1240 - Asteroids!(三维空间的BFS)
- hdoj-1240-Asteroids!(dfs和bfs)
- HDOJ 1240 Asteroids!(三维BFS)
- hdoj Asteroids! (BFS)
- HDOJ 1242 Rescue (BFS+优先队列)
- HDOJ(1242)BFS+优先队列
- hdoj 2822 Dogs(BFS+优先队列)
- HDOJ 1242 Rescue 优先队列+bfs
- hdoj 1242 Rescue 【BFS + 优先队列】
- hdoj 1372 Knight Moves 【BFS+优先队列】
- HDOJ 1242 Rescue(bfs+优先队列)
- hdoj 1242 Rescue (bfs+优先队列)
- HDOJ-1242(Rescue)(bfs+优先队列)
- hdoj 1242 Rescue (bfs 优先队列)
- HDOJ 1242 Rescue(BFS + 优先队列)
- HDOJ 1242 Rescue(优先队列+BFS)
- 杭电1228 A+B
- 精彩百例:函数的递归调用
- 五大算法之二--动态规划
- ResultSet用法集锦
- Unity编辑器扩展之RequireComponent等详解
- HDOJ 1240 Asteroids! 【BFS+优先队列】
- 在.NET Framework 2.0即以下平台下操作UDT
- 五大算法之三--贪心算法
- quartus中引脚配置
- POJ_2481(树状数组)
- linux中用到的头文件标注
- DHCP option43之sub-option设置
- C# Code
- java抽象类