HDU2612 （Find a way）

题目就不描述了。。。就是BFS求最短路的题，比较简单，挺适合初学者的。。

第一次用BFS解求最短路问题，本来可以1A的，因为队列长度估计错误，

贡献两次WA，晕。。

#include<stdio.h>
#include<string.h>
#define SIZE 100000 //因为队列开小了贡献了两次WA，一看是200*200的数据，就改成100000，然后过了，泪啊、、 
#define inf 0xffffff
typedef struct node
{
    int xx,yy;
};

node Q[SIZE];
char grid[500][500];
int front,rear,vis[300][300];
int n,m,disy[300][300],dism[300][300];

void enque(int x,int y)
{
    rear++;
    Q[rear].xx=x;
    Q[rear].yy=y;
    vis[x][y]=1;
}

void initi(int a,int b,int dis[][300])
{
    for (int i=0;i<=250;i++)
        for (int j=0;j<=250;j++)
            dis[i][j]=inf;
    memset(vis,0,sizeof(vis));
    dis[a][b]=0;
}

node deque()
{
    front++;
    return Q[front];
}

int empty()
{
    return front==rear?1:0;
}

void bfs(int x,int y,int dis[][300])
{
    enque(x,y);
    while (!empty())
    {
        node out=deque();
        if (!vis[out.xx-1][out.yy]&&grid[out.xx-1][out.yy]!='#'&&out.xx-1>=1)
        {
            dis[out.xx-1][out.yy]=dis[out.xx][out.yy]+1;
            enque(out.xx-1,out.yy);
        }
        if (!vis[out.xx+1][out.yy]&&grid[out.xx+1][out.yy]!='#'&&out.xx+1<=n)
        {
            dis[out.xx+1][out.yy]=dis[out.xx][out.yy]+1;
            enque(out.xx+1,out.yy);
        }
        if (!vis[out.xx][out.yy-1]&&grid[out.xx][out.yy-1]!='#'&&out.yy-1>=1)
        {
            dis[out.xx][out.yy-1]=dis[out.xx][out.yy]+1;
            enque(out.xx,out.yy-1);
        }
        if (!vis[out.xx][out.yy+1]&&grid[out.xx][out.yy+1]!='#'&&out.yy+1<=m)
        {
            dis[out.xx][out.yy+1]=dis[out.xx][out.yy]+1;
            enque(out.xx,out.yy+1);
        }
    }
}


int min(int a,int b)
{
    return a>b?b:a;
}

int main()
{
    while (~scanf("%d%d",&n,&m))
    {
        int i,j,yi,yj,mi,mj,res=inf;
        for (i=1;i<=n;i++)
            for (j=1;j<=m;j++)
            {
                scanf("\n%c",&grid[i][j]);
                if (grid[i][j]=='Y')
                    yi=i,yj=j;
                if (grid[i][j]=='M')
                    mi=i,mj=j;
            }
        front=-1,rear=-1;
        initi(yi,yj,disy);
        grid[mi][mj]='.';
        bfs(yi,yj,disy);
        grid[mi][mj]='M';

        front=-1,rear=-1;
        initi(mi,mj,dism);
        grid[yi][yj]='.';
        bfs(mi,mj,dism);
        grid[yi][yj]='Y';

        for (i=1;i<=n;i++)
            for (j=1;j<=m;j++)
                if (grid[i][j]=='@')
                    res=min(res,(disy[i][j]+dism[i][j])*11);
        printf("%d\n",res);
    }
    return 0;
}