poj 3083

#include <iostream>
#include <limits>
#include <queue>
using namespace std;

typedef pair<int, int> P;

char maze[41][41]; 
int dist[41][41];
int spDirX[4] = {1, 0, -1, 0};
int spDirY[4] = {0, 1, 0, -1};
int n;
int w, h;
int startX, startY;
int endX, endY;
const int INF = numeric_limits<int>::max();
int sp, lo, ro;
int dx[4] = {
        0, 1, 0, -1
};
int dy[4] = {
        -1, 0, 1, 0    
};
void leftOrder(int x, int y, int sum, int dir)
{
    //ÖÕÖ¹ 
    if(x == endX && y == endY)
    {
        lo = sum;
        return ;
    }
    //µÚÒ»¸öÔªËØÈ·¶¨·½Ïò
    if(sum == 1)
    {
        for(int i = 0; i < 4; ++i)
        {
            int nx = x + dx[i];
            int ny = y + dy[i];
            if(nx >= 0 && nx < w && ny >= 0 && ny < h && maze[ny][nx] == '.')
            {
                    leftOrder(nx, ny , sum+1, i);
                    break;
            }
            
        }
    }
    else
    {
        //Ò»°ãÇé¿ö 
        dir = (dir+3) % 4;
        for(int i = 0; i < 4; ++i)
        {
            int nx = x + dx[(dir+i)%4];
            int ny = y + dy[(dir+i)%4];
            if(nx >= 0 && nx < w && ny >= 0 && ny < h && maze[ny][nx] != '#')
            {
                leftOrder(nx, ny , sum+1, (dir+i)%4);
                break;
            }        
        }    
    }
    
}

void rightOrder(int x, int y, int sum, int dir)
{
        //ÖÕÖ¹ 
    if(x == endX && y == endY)
    {
        ro = sum;
        return ;
    }
    //µÚÒ»¸öÔªËØÈ·¶¨·½Ïò
    if(sum == 1)
    {
        for(int i = 0; i < 4; ++i)
        {
            int nx = x + dx[i];
            int ny = y + dy[i];
            if(nx >= 0 && nx < w && ny >= 0 && ny < h && maze[ny][nx] == '.')
            {
                    rightOrder(nx, ny , sum+1, i);
                    break;
            }
            
        }
    }
    else
    {
        //Ò»°ãÇé¿ö 
        dir = (dir+1) % 4;
        for(int i = 0; i < 4; ++i)
        {
            int nx = x + dx[(dir-i+4)%4];
            int ny = y + dy[(dir-i+4)%4];
            if(nx >= 0 && nx < w && ny >= 0 && ny < h && maze[ny][nx] != '#')
            {
                rightOrder(nx, ny , sum+1, (dir-i+4)%4);
                break;
            }        
        }    
    }
    
} 

int shortPath()
{
    queue<P> que; 
    dist[startY][startX] = 1;
    que.push(P(startX, startY));
    while(que.size())
    {
        P temp = que.front();
        que.pop();
        if(temp.first == endX && temp.second == endY)
            break;
        for(int i = 0; i < 4; ++i)
        {
            int nx = temp.first + spDirX[i];
            int ny = temp.second + spDirY[i];
            if(nx >= 0 && ny >= 0 && nx < w && ny < h && dist[ny][nx] == INF && maze[ny][nx] != '#')
            {
                que.push(P(nx, ny));
                dist[ny][nx] = dist[temp.second][temp.first] + 1;
            }
        }        
    }
    sp = dist[endY][endX];
}


int main()
{
    cin >> n;
    for(int i = 0; i < n; ++i)
    {
        cin >> w >> h;
        for(int j = 0; j < h; ++j)
        {
            for(int k = 0; k < w; ++k)
            {
                cin >> maze[j][k];
                dist[j][k] = INF;
                if(maze[j][k] == 'S')
                {
                    startX = k;
                    startY = j;
                }
                if(maze[j][k] == 'E')
                {
                    endX = k;
                    endY = j;
                }    
            }
        }
        leftOrder(startX, startY, 1, 0);
        rightOrder(startX, startY, 1, 0);
        shortPath();    
        cout << lo << " " << ro << " " << sp << endl;    
    }
    return 0;
}