程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> 關於C++ >> HDOJ 1240 Asteroids!

HDOJ 1240 Asteroids!

編輯:關於C++

 

 

Asteroids!

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3643 Accepted Submission(s): 2413



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 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 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

Source South Central USA 2001

 

題意:一個三維的空間,從一個點到另一個點的最少步數。

題解;BFS模板,主要是要注意坐標的處理。

AC代碼:

 

#include
#include
#include
#include
#define N 15
using namespace std;
char chess[N][N][N];
string str;
int n,sx,sy,sz,ex,ey,ez,visit[N][N][N];
int dir[][3]={
    {0,0,1},{0,0,-1},{1,0,0},
    {-1,0,0},{0,1,0},{0,-1,0}
};
struct Node{
    int x,y,z,s;
};
bool ok(int x,int y,int z){
    if(x>=0&&x=0&&y=0&&z q;
    Node head={sx,sy,sz,0};
    q.push(head);
    memset(visit,-1,sizeof(visit));
    visit[sx][sy][sz]=0;
    while(q.size()){
        Node f=q.front();
        if(f.x==ex&&f.y==ey&&f.z==ez)return f.s;
        q.pop();
        for(int i=0;i<6;i++){
            int dx=f.x+dir[i][0],dy=f.y+dir[i][1],dz=f.z+dir[i][2];
            if(ok(dx,dy,dz)&&visit[dx][dy][dz]){
                visit[dx][dy][dz]=0;
                Node t={dx,dy,dz,f.s+1};
                q.push(t);
            }
        }
    }
    return -1;
}
int main()
{
        while(cin>>str>>n){
            for(int i=0;i>chess[k][j][i];
            cin>>sx>>sy>>sz>>ex>>ey>>ez;
            cin>>str;
            int tmp=bfs();
            if(tmp!=-1)cout<【轉載請注明出處】

 

作者:MummyDing

出處:http://blog.csdn.net/mummyding

 

 

  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved