hdu4528

/*
分析：
    bfs水题，太抠内存结果把自己坑死了。。。
    一个点可以重复走。晒下代码、个人自恋的感觉还是挺简洁的I→_→。
eg:
4 4 10
XX.D
XX.X
XXSX
XX.E

                                        2013-07-26
*/

#include"iostream"
#include"cstdio"
#include"queue"
#include"cstring"
using namespace std;
const int N=106;

int n,m,ts;
int s_x,s_y,look[N][N],flag[N][N][4];
char map[N][N];
struct node{
    int x,y,step,ans;
};
int dir[4][2]={{1,0},{-1,0},{0,1},{0,-1}};

void init()
{
    int i,l,a,b;
    memset(look,0,sizeof(look));
    for(i=0;i<n;i++)
    for(l=0;l<m;l++)
    {
        a=i;b=l;
        while(map[a][b]=='.' && b<m)    b++;
        if(b<m && map[a][b]=='D')    look[i][l]|=(1<<0);
        if(b<m && map[a][b]=='E')    look[i][l]|=(1<<1);

        a=i;b=l;
        while(map[a][b]=='.' && b>=0)    b--;
        if(b>=0 && map[a][b]=='D')    look[i][l]|=(1<<0);
        if(b>=0 && map[a][b]=='E')    look[i][l]|=(1<<1);

        a=i;b=l;
        while(map[a][b]=='.' && a<n)    a++;
        if(a<n && map[a][b]=='D')    look[i][l]|=(1<<0);
        if(a<n && map[a][b]=='E')    look[i][l]|=(1<<1);

        a=i;b=l;
        while(map[a][b]=='.' && a>=0)    a--;
        if(a>=0 && map[a][b]=='D')    look[i][l]|=(1<<0);
        if(a>=0 && map[a][b]=='E')    look[i][l]|=(1<<1);
    }
}
int bfs()
{
    int i;
    queue<node>q;
    node now,next;

    now.x=s_x;
    now.y=s_y;
    now.step=0;
    now.ans=look[now.x][now.y];
    q.push(now);
    memset(flag,0,sizeof(flag));
    flag[now.x][now.y][now.ans]=1;

    while(!q.empty())
    {
        now=q.front();
        q.pop();
        if(now.step>ts)    break;
        if(now.ans==3)    return now.step;
        for(i=0;i<4;i++)
        {
            next.x=now.x+dir[i][0];
            next.y=now.y+dir[i][1];
            if(next.x<0 || next.x>=n || next.y<0 || next.y>=m)    continue;
            if(map[next.x][next.y]=='X')continue;
            if(map[next.x][next.y]=='D')continue;
            if(map[next.x][next.y]=='E')continue;
            next.ans=now.ans;
            next.step=now.step+1;
            next.ans|=look[next.x][next.y];
            if(flag[next.x][next.y][next.ans])    continue;
            q.push(next);
            flag[next.x][next.y][next.ans]=1;
        }
    }

    return -1;
}
int main()
{
    int T,Case;
    int i,l;
    cin>>T;
    for(Case=1;Case<=T;Case++)
    {
        cin>>n>>m>>ts;
        for(i=0;i<n;i++)
        {
            scanf("%s",map[i]);
            for(l=0;l<m;l++)    if(map[i][l]=='S')    {s_x=i;s_y=l;map[i][l]='.';}
        }
        init();
        printf("Case %d:\n",Case);
        printf("%d\n",bfs());
    }
    return 0;
}