x1=x2; y1=y2;
x2=temp1; y2=temp2;
}
}
s++;
}
if(x2==pos_endx&&y2==pos_endy)
{
k=s;
break;
}
}
}
void deal()
{
int i,j,base,top,x,y,xend,yend;
int queue[100000][2];
int sum[50][50];
memset(status,0,sizeof(status));
memset(sum,0,sizeof(sum));
base=top=0;
queue[top][0]=pos_stax; queue[top++][1]=pos_stay;
sum[pos_stax][pos_stay]=1; status[pos_stax][pos_stay]=1;
x=queue[base][0]; y=queue[base++][1];
for(i=0;i<=3;i++)
{
xend=x+bx1[i]; yend=y+by1[i];
if(xend>=1&&xend<=n& d>=1& d<=m&&!status[xend][yend]&&a[xend][yend])
{
sum[xend][yend]=sum[x][y]+1;
status[xend][yend]=1;
queue[top][0]=xend; queue[top++][1]=yend;
if(xend==pos_endx& d==pos_endy)
{
break;
}
}
}
if(i!=4)
{
break;
}
}
res3=sum[pos_endx][pos_endy];
}