Time Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64u

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

Source

South Central USA 2001

AC代码：

#include <cstdio>
#include <queue>
using namespace std;
char map[15][15][15];
int size;
struct node
{
int x, y, z, step;
bool operator == (const node b) const
{
return x == b.x && y == b.y && z == b.z;
}
};
const int dx[] = {0, 0, 0, 0, 1, -1},
dy[] = {0, 0, 1, -1, 0, 0},
dz[] = {1, -1, 0, 0, 0, 0};
node start, goal;
queue <node> q;
void input()
{
char t[5];
for (int i = 0; i < size; i++)
for (int j = 0; j < size; j++)
{
for (int k = 0; k < size; k++)
scanf("%c", &map[j][k][i]);
getchar();
}
scanf("%d %d %d\n%d %d %d\n", &start.x, &start.y, &start.z, &goal.x, &goal.y, &goal.z);
start.step = goal.step = 0;
gets(t);
}
bool check(int x, int y, int z)
{
if (x < 0 || x >= size || y < 0 || y >= size || z < 0 || z >= size || map[x][y][z] == 'X')
return 0;
return 1;
}
void solve()
{
while (!q.empty())
q.pop();
q.push(start);
while (!q.empty())
{
node u = q.front();
q.pop();
if (u == goal)
{
printf("%d %d\n", size, u.step);
return;
}
node next;
for (int i = 0; i < 6; i++)
{
next.x = u.x + dx[i];
next.y = u.y + dy[i];
next.z = u.z + dz[i];
if (!check(next.x, next.y, next.z))
continue;
map[next.x][next.y][next.z] = 'X';
next.step = u.step + 1;
q.push(next);
}
}
printf("NO ROUTE\n");
}
int main()
{
while (scanf("START %d\n", &size) == 1)
{
input();
solve();
}
return 0;
}