POJ2225:Asteroids!(BFS)
来源:互联网 发布:ubuntu终端怎么打开 编辑:程序博客网 时间:2024/05/16 10:50
Description
You want to get home.
There are asteroids.
You don't want to hit them.
Input
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
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
#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
using namespace std;
int step[11][11][11];
#define inf 10000000
int n;
struct node
{
int x,y,z;
int step;
};
int dirt[6][3]={{1,0,0},{-1,0,0},{0,1,0},{0,-1,0},{0,0,1},{0,0,-1}};
char mat[11][11][11];
char tp[20];
node bg,ed;
bool reach;
void init()
{
int i,j,k;
for(k=0;k<n;k++)
{
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
step[i][j][k]=inf;
}
}
}
}
int bfs()
{
queue<node> q;
step[bg.x][bg.y][bg.z]=0;
bg.step=0;
q.push(bg);
while(!q.empty())
{
node p=q.front();
if(p.x==ed.x&&p.y==ed.y&&p.z==ed.z)
{
return p.step;
}
q.pop();
//cout<<"move to"<<p.x<<" "<<p.y<<" "<<p.z<<endl;
node tp;
int i;
for(i=0;i<6;i++)
{
tp=p;
tp.x+=dirt[i][0];
tp.y+=dirt[i][1];
tp.z+=dirt[i][2];
//cout<<tp.x<<"*"<<tp.y<<"*"<<tp.z<<endl;
tp.step++;
//cout<<"show "<<step[tp.x][tp.y][tp.z]<<" "<<tp.step<<endl;
if(mat[tp.x][tp.y][tp.z]=='O'&&
tp.x>=0&&tp.x<n&&tp.y>=0&&tp.y<n&&tp.z>=0&&tp.z<n
&&step[tp.x][tp.y][tp.z]>tp.step)
{
//cout<<"push"<<endl;
step[tp.x][tp.y][tp.z]=tp.step;
q.push(tp);
}
}
}
return -1;
}
int main()
{
while(scanf("%s",&tp)!=EOF)
{
scanf("%d",&n);
int i,j,k;
for(k=0;k<n;k++)
{
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
cin>>mat[i][j][k];
}
}
}
/*for(k=0;k<n;k++)
{
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
cout<<mat[i][j][k];
}
cout<<endl;
}
cout<<endl;
}*/
scanf("%d%d%d",&bg.y,&bg.x,&bg.z);
scanf("%d%d%d",&ed.y,&ed.x,&ed.z);
scanf("%s",&tp);
init();
int ans=bfs();
if(ans!=-1)
{
printf("%d %d\n",n,ans);
}
else
printf("NO ROUTE\n");
}
}
//
BFS,三维空间的搜索.
- POJ2225:Asteroids!(BFS)
- POJ2225 Asteroids! (三维的BFS求最短路)
- hdu1240/poj2225 BFS广搜的再理解
- zoj 1438 Asteroids! BFS
- hdu 1240 Asteroids BFS
- HDU1240:Asteroids!(BFS)
- hdu1240 Asteroids! (BFS)
- hdu 1240 Asteroids!bfs
- HDU 1240 Asteroids!(BFS)
- hdu 1240 Asteroids!(BFS)
- Asteroids!(三维BFS)
- HDU 1240 Asteroids! 【BFS】
- hdoj Asteroids! (BFS)
- Asteroids!-裸的BFS
- hdu 1240 Asteroids! (bfs)
- poj 2225 Asteroids!【BFS】
- HDU1240 Asteroids!(BFS)
- hdu 1240 Asteroids!【BFS】
- 面向对象的 构造函数和析构函数 调用 生命周期
- Android开发每次都需要按一个退格键或者回车才能显示出我edittext控件里面的内容
- 网址
- FF,IE区别---手型指针
- android中listview实现分页的解决办法
- POJ2225:Asteroids!(BFS)
- MySQL中的日期和时间存储
- 在VC中调用Web Service (非托管方式)
- android view树的绘制流程
- 为什么需要管理者
- RISC和CISC的区别
- 传奇人物 Donald E. Knuth 高纳德,真正的技术大牛
- 振奋吧!熊猫!
- 关于php按值传递和按引用传递问题