/**************************************************************************************
* Function     : test
* Create Date  : 2014/07/13
* Author       : NTSK13
* Email        : [email protected]
* Copyright    : 歡迎大家和我一起交流學習，轉載請保持原始檔的完整性。
                                              任何單位和個人不經本人允許不得用於商業用途
* Version      : V0.1  	  				
***************************************************************************************					  
經典c程式(0038) ---矩陣中兩點最短距離BFS

題目：10 * 10 矩陣 。0為牆， 1為通道， 2 為起點 ，3 為終點， 求七點到終點最短距離，單位為1

0 0 0 0 0 0 0 0 0 0
0 1 1 1 1 0 1 1 1 0
0 2 0 0 1 1 1 0 1 1
0 1 0 0 0 0 0 0 0 1
0 1 1 1 1 1 1 1 1 1
0 1 0 1 0 0 0 0 0 1
0 1 0 1 1 1 1 0 0 1
0 1 1 0 0 1 1 3 1 1
0 0 1 1 1 1 0 0 0 0
0 0 0 0 0 0 0 0 0 0

**************************************************************************************/
#include <stdio.h>  
  
#define M 10
int data[M][M];

typedef struct{
	int x;
	int y;
	int level;
}Pos;
Pos start,end;
int offset[4][2]={-1,0,0,1,1,0,0,-1};
int mark[M][M];
int get_length(Pos start);

/****************************************************************************************/

typedef struct{
	Pos store[M*M];
	int head;
	int tail;
}Queue;

void init_queue(Queue *A)
{
	(*A).head=-1;
	(*A).tail=-1;
}

int in_queue(Queue *A, Pos val)
{
	if( (*A).tail == M*M-1 )//full
		return (0);
	(*A).store[ ++(*A).tail]=val;
	return (1);
}
int out_queue(Queue *A, Pos * val)
{
	if( (*A).head==-1 && (*A).tail==-1)//empty
		return (0);
	*val=(*A).store[ ++(*A).head];
	return (1);
}
Queue B;
/****************************************************************************************/
int main(void)  
{  
    int tc=0, T=0,th=0;
  
    // The freopen function below opens input.txt file in read only mode, and afterward,  
    // the program will read from input.txt file instead of standard(keyboard) input.  
    // To test your program, you may save input data in input.txt file,  
    // and use freopen function to read from the file when using scanf function.  
    // You may remove the comment symbols(//) in the below statement and use it.  
    // But before submission, you must remove the freopen function or rewrite comment symbols(//).  
  
     freopen("input.txt", "r", stdin);  
  
    // If you remove the statement below, your program's output may not be rocorded  
    // when your program is terminated after the time limit.  
    // For safety, please use setbuf(stdout, NULL); statement.  
  
    setbuf(stdout, NULL);  
  
    scanf("%d", &T);  
    for(tc = 0; tc < T; tc++)  
    {  
  
        /**********************************/  
        int i=0,j=0,ret=0;  

        scanf("%d", &th);
        /******************************************************************/
        for(i=0;i<M;i++)
        for(j=0;j<M;j++)
        {
        	scanf("%d",&data[i][j]);
        	mark[i][j]=0;
        	if(data[i][j]==2)
        	{
        		start.x=i;
        		start.y=j;
        	}
        	if(data[i][i]==3)
        	{
        		end.x=i;
        		end.y=j;
        	}
        }
        ret=get_length(start);
        /******************************************************************/
        printf("#%d %d\n",th,ret);
		fflush(stdout);//修復Eclipse printf（）不能顯示的小bug  
        // Print the answer to standard output(screen).  
    }  
  
    return (0);//Your program should return 0 on normal termination.
}  

int get_length(Pos start)
{
	int x=0,y=0,level=0,tx=0,ty=0,tlevel=0,k=0,ret=0;
	Pos tmp;

	start.level=0;
	init_queue(&B);//初始化佇列

	in_queue(&B,start);//初始化原點,原點進棧
	mark[start.x][start.y]=1;

	while( B.head != B.tail)
	//while(1)
	{
		out_queue(&B,&tmp);
		x=tmp.x;
		y=tmp.y;
		level=tmp.level;//出棧
		if(x==end.x && y==end.y)
		{
			ret=tmp.level;
			break;
		}
		for(k=0;k<4;k++)
		{
			tx=x+offset[k][0];
			ty=y+offset[k][1];
			tlevel=level+1;
			if( tx>=0 && tx<M && ty>=0 && ty<M && mark[tx][ty]==0  )
			{
				if( data[tx][ty]==1 || data[tx][ty]==3)//入棧
				{
					tmp.x=tx;
					tmp.y=ty;
					tmp.level=tlevel;
					in_queue(&B,tmp);
				}
				mark[tx][ty]=1;
			}
		}
	}
	return ret;
}