poj 3083 Children of th

#include <iostream>
#include<stdio.h>
#include<string.h>

using namespace std;
int n,m;
int r[4][2]= {{0,-1},{1,0},{0,1},{-1,0}};
int l[4][2]= {{0,1},{1,0},{0,-1},{-1,0}};
int vis[50][50];
char map[50][50];
int x1,x2,y1,y2,ans;
int que[2500][2];
int dfsl(int x,int y,int num1)
{
    if(x==x2&&y==y2)
        return ++num1;
    if(x<0||x>=n||y<0||y>=m||map[x][y]==‘#‘)
        return 0;
    ans=(ans+3)%4;
    int temp=0;
    while(1)
    {
        temp=dfsl(x+l[ans][0],y+l[ans][1],num1+1);
        if(temp>0)
            break;
        ans=(ans+1)%4;
    }
    return temp;

}

int dfsr(int x,int y,int num2)
{
    if(x==x2&&y==y2)
        return ++num2;
    if(x<0||x>n||y<0||y>m||map[x][y]==‘#‘)
        return 0;
    ans=(ans+3)%4;
    int temp=0;
    while(1)
    {
        temp=dfsr(x+r[ans][0],y+r[ans][1],num2+1);
        if(temp>0)
            break;
        ans=(ans+1)%4;
    }
    return temp;

}

int bfs()
{
    int fir=0,sec=0;
    que[sec][0]=x1;
    que[sec++][1]=y1;
    vis[x1][y1]=1;
    int step=1;
    while(fir<sec&&!vis[x2][y2])
    {
        int tmp=sec;
        step++;
        while(fir<tmp&&!vis[x2][y2])
        {
            int x=que[fir][0];
            int y=que[fir++][1];
            for(int i=0; i<4; i++)
            {
                int x1=x+r[i][0];
                int y1=y+r[i][1];
                if(x1>=0&&x1<n&&y1>=0&&y1<m&&!vis[x1][y1]&&map[x1][y1]!=‘#‘)
                {
                    que[sec][0]=x1;
                    que[sec++][1]=y1;
                    vis[x1][y1]=1;
                }
            }
        }
    }
    return step;
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&m,&n);
        memset(que,0,sizeof(que));
        memset(vis,0,sizeof(vis));
        for(int i=0; i<n; i++)
        {
            // scanf("%s",map[i]);
            for(int j=0; j<m; j++)
            {
                cin>>map[i][j];
                if(map[i][j]==‘S‘)
                {
                    x1=i;
                    y1=j;
                }
                if(map[i][j]==‘E‘)
                {
                   x2=i;
                    y2=j;
                }
            }
        }
        ans=0;
        printf("%d",dfsl(x1,y1,0));
        ans=0;
        printf(" %d",dfsr(x1,y1,0));
        printf(" %d\n",bfs());
    }
    return 0;
}