推箱子 小时候困扰我多时的问题 只会过前两关的恐惧终于被电脑克服了

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<queue>
using namespace std;
int x0,y0;
int x2,y2;
int x1,y1;
int x,y;
int m,n;
int bug;
int flag[10][10][10][10];
char maze[10][10];
void input();
void init();
void search();
queue<int> row1;
queue<int> col1;
queue<int> row2;
queue<int> col2;
int main()
{
input();

init();


    while(!row1.empty()&&bug==1)
    {
    search();
    }  
    if(bug!=0&&bug!=1)
    {
    printf("%d\n",bug-1);
    }
    else
    {
    printf("-1\n");
    }
    
    return 0;
}
void input()
{
int i,j;

for(i=0;i<10;i++)
{
for(j=0;j<10;j++)
{
scanf("%c",&maze[i][j]);

if(maze[i][j]=='4')
{
x0=i;

y0=j;
}
if(maze[i][j]=='3')
{
x2=i;

y2=j;
}
if(maze[i][j]=='2')
{
x1=i;

y1=j;
}
}
if(i<9)
{
scanf("\n");
}
}
}
void init()
{
    flag[x0][y0][x1][y1]=1;
bug=1;
row1.push(x0);
row2.push(x1);
col1.push(y0);
col2.push(y1);
}
void search()
{
x=row1.front();
row1.pop();

y=col1.front();
col1.pop();

m=row2.front();
row2.pop();

n=col2.front();
col2.pop();

if(x==m&&y==n+1&&n>0&&maze[m][n-1]!='1'&&flag[x][y-1][m][n-1]==0)
{
if(m==x2&&n-1==y2)
{
bug=flag[x][y][m][n]+1;;
return ;
}
else
{
flag[x][y-1][m][n-1]=flag[x][y][m][n]+1;
row1.push(x);
col1.push(y-1);
row2.push(m);
col2.push(n-1);
}
}
    if((x!=m||y!=n+1)&&y>0&&maze[x][y-1]!='1'&&flag[x][y-1][m][n]==0)
    {
    flag[x][y-1][m][n]=flag[x][y][m][n]+1;
    row1.push(x);
col1.push(y-1);
row2.push(m);
col2.push(n);
    }
if(x==m&&y==n-1&&n<9&&maze[m][n+1]!='1'&&flag[x][y+1][m][n+1]==0)
{
if(m==x2&&n+1==y2)
{
bug=flag[x][y][m][n]+1;;
return ;
}
else
{
flag[x][y+1][m][n+1]=flag[x][y][m][n]+1;
row1.push(x);
col1.push(y+1);
row2.push(m);
col2.push(n+1);
}
}
    if((x!=m||y!=n-1)&&y<9&&maze[x][y+1]!='1'&&flag[x][y+1][m][n]==0)
    {
    flag[x][y+1][m][n]=flag[x][y][m][n]+1;
    row1.push(x);
col1.push(y+1);
row2.push(m);
col2.push(n);
    }
if(y==n&&x==m+1&&m>0&&maze[m-1][n]!='1'&&flag[x-1][y][m-1][n]==0)
{
if(m-1==x2&&n==y2)
{
bug=flag[x][y][m][n]+1;;
return ;
}
else
{
flag[x-1][y][m-1][n]=flag[x][y][m][n]+1;
row1.push(x-1);
col1.push(y);
row2.push(m-1);
col2.push(n);
}
}
    if((x!=m+1||y!=n)&&x>0&&maze[x-1][y]!='1'&&flag[x-1][y][m][n]==0)
    {
    flag[x-1][y][m][n]=flag[x][y][m][n]+1;
    row1.push(x-1);
col1.push(y);
row2.push(m);
col2.push(n);
    }
if(y==n&&x==m-1&&m<9&&maze[m+1][n]!='1'&&flag[x+1][y][m+1][n]==0)
{
if(m+1==x2&&n==y2)
{
bug=flag[x][y][m][n]+1;;
return ;
}
else
{
flag[x+1][y][m+1][n]=flag[x][y][m][n]+1;
row1.push(x+1);
col1.push(y);
row2.push(m+1);
col2.push(n);
}
}
    if((x!=m-1||y!=n)&&x<9&&maze[x+1][y]!='1'&&flag[x+1][y][m][n]==0)
    {
    flag[x+1][y][m][n]=flag[x][y][m][n]+1;
    row1.push(x+1);
col1.push(y);
row2.push(m);
col2.push(n);
    }
}