HDOJ 1240 Asteroids! 【BFS+优先队列】
2015-03-28 11:22
239 查看
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.
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.
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
优先队列+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; }
相关文章推荐
- hdoj-1240-Asteroids!(dfs和bfs)
- HDOJ 1026 Ignatius and the Princess I (BFS优先队列超时 TLE)
- hdoj 1372 Knight Moves 【BFS+优先队列】
- HDOJ 1240 Asteroids!(三维BFS)
- hdoj 4198 Quick out of the Harbour 优先队列 + bfs
- hdoj - 1240 - Asteroids!(三维空间的BFS)
- HDOJ 题目3152 Obstacle Course(BFS,优先队列优化)
- HDU1242 rescue 【BFS+优先队列】
- 【BFS+优先队列】Battle City(poj-2312)
- hdu 1242 Rescue(优先队列 && 广搜BFS)
- 【BFS&&优先队列】HDU 1180 诡异的楼梯
- HDU 1242 Rescue【优先队列BFS】
- hdu 1242 rescue (优先队列 bfs)
- nyoj 483 Nightmare【bfs+优先队列】
- [优先队列]HDOJ5289 Assignment
- PKU I Wanna Go Home 3767 Dijsktra 优先队列 + BFS
- hdu 5025 Saving Tang Monk bfs+优先队列 2014 ACM/ICPC Asia Regional Guangzhou Online
- NYOJ 284 坦克大战 【BFS】+【优先队列】
- hdu 1026 Ignatius and the Princess I bfs 优先队列 路径记录
- Gym - 101196D Lost in Translation【BFS+优先队列】