题目
这有一个迷宫,有0~8行和0~8列:
1,1,1,1,1,1,1,1,1
1,0,0,1,0,0,1,0,1
1,0,0,1,1,0,0,0,1
1,0,1,0,1,1,0,1,1
1,0,0,0,0,1,0,0,1
1,1,0,1,0,1,0,0,1
1,1,0,1,0,1,0,0,1
1,1,0,1,0,0,0,0,1
1,1,1,1,1,1,1,1,1
0表示道路,1表示墙。
现在输入一个道路的坐标作为起点,再如输入一个道路的坐标作为终点,问最少走几步才能从起点到达终点?
(注:一步是指从一坐标点走到其上下左右相邻坐标点,如:从(3,1)到(4,1)。)
输入描述:
第一行输入一个整数n(0<n<=100),表示有n组测试数据;
随后n行,每行有四个整数a,b,c,d(0<=a,b,c,d<=8)分别表示起点的行、列,终点的行、列。
输出描述:
输出最少走几步。
样例输入:
2
3 1 5 7
3 1 6 7
样例输出:
12
11
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<stdlib.h>
#include<queue>
#include<stack>
using namespace std;
int maze[9][9]={
1,1,1,1,1,1,1,1,1,
1,0,0,1,0,0,1,0,1,
1,0,0,1,1,0,0,0,1,
1,0,1,0,1,1,0,1,1,
1,0,0,0,0,1,0,0,1,
1,1,0,1,0,1,0,0,1,
1,1,0,1,0,1,0,0,1,
1,1,0,1,0,0,0,0,1,
1,1,1,1,1,1,1,1,1
};
int ji[20][20]= {0};
struct xxx
{
int x;
int y;
int step;
};
int k;
int mov[4][2]= {1,0,-1,0,0,-1,0,1};
int sx,sy,ex,ey;
void re(xxx start)
{
queue<xxx>q;
q.push(start);
xxx nex;
xxx now;
while(q.empty()==0)
{
now=q.front();
// printf("Z***%d %d %d\n",now.x,now.y,now.step);
q.pop();
for(int i=0; i<4; i++)
{
nex.x=now.x+mov[i][0];
nex.y=now.y+mov[i][1];
if(nex.x<0||nex.y<0||nex.x>=8||nex.y>=8)
continue;
if(maze[nex.x][nex.y]==0&&ji[nex.x][nex.y]==0)
{
ji[nex.x][nex.y]=1;
nex.step=now.step+1;
q.push(nex);
if(nex.x==ex&&nex.y==ey)
{
k=nex.step;
return ;
}
}
}
}
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
memset(ji,0,sizeof(ji));
k=0;
xxx start;
scanf("%d %d %d %d",&sx,&sy,&ex,&ey);
ji[sx][sy]=1;
start.x=sx;
start.y=sy;
start.step=0;
re(start);
printf("%d\n",k);
}
return 0;
}