[kuangbin带你飞]专题一 简单搜索 - N - Find a way

正确代码：

 #include<iostream>
 #include<queue>
 #define N 210
 #define inf 0xffffff
 using namespace std;
 int m,n,mark[N][N],dis[N][N][],dir[][]={,, ,, -,, ,-},flag;
 char s[N][N];
 struct node{
    int x,y,step;
 };
 bool judge(int x,int y)
 {
    if(x>= && x<m && y>= && y<n && s[x][y]!='#' && mark[x][y]==)
        return ;
    return ;
 }
 void bfs(int x,int y)
 {
    int k;
    queue<node>q;
    node cur,next;
    cur.x=x;cur.y=y;cur.step=;
    mark[x][y]=;
    q.push(cur);
    while(!q.empty())
    {
        cur=q.front();
        q.pop();
        next.step=cur.step+;
        for(k=;k<;k++)
        {
            next.x=x=cur.x+dir[k][];
            next.y=y=cur.y+dir[k][];
            if(judge(x,y))
            {
                mark[x][y]=;
                if(s[x][y]=='@')
                    dis[x][y][flag]=next.step;
                q.push(next);
            }
        }
    }
 }

 int main()
 {
    int i,j,min;
    while(scanf("%d %d",&m,&n)!=-)
    {
        min=inf;
        for(i=;i<m;i++)
            for(j=;j<n;j++)
                dis[i][j][]=dis[i][j][]=inf;

        for(i=;i<m;i++)
            scanf("%s",s[i]);
        for(i=;i<m;i++)
            for(j=;j<n;j++)
            {
                if(s[i][j]=='Y')
                {
                    flag=;
                    memset(mark,,sizeof(mark));
                    bfs(i,j);
                }
                else if(s[i][j]=='M')
                {
                    flag=;
                    memset(mark,,sizeof(mark));
                    bfs(i,j);
                }
            }
        for(i=;i<m;i++)
            for(j=;j<n;j++)
                if(s[i][j]=='@' && min>dis[i][j][]+dis[i][j][])
                    min=dis[i][j][]+dis[i][j][];
            printf("%d\n",min*);
    }
    return ;
 }

被逼疯代码：

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<queue>
 #define INF 0x3f3f3f3f
 using namespace std;
 struct node
 {
     int x;
     int y;
     int step;
 };
 char g[][];
 int stepA[][];
 int stepB[][];
     queue<node>q;
 int yx, yy, mx, my;
 int x, y;
 long long ans;
 int d[][]={{,},{,},{,-},{-,}};

 int main()
 {
 //    freopen("in.in","r",stdin);
 //    freopen("out.txt","w",stdout);
     while(scanf("%d%d",&x,&y)!=EOF)
     {
         memset(g,,sizeof(g));
         memset(stepA,-,sizeof(stepA));
         memset(stepB,-,sizeof(stepB));
         char tmp[];
         for(int i = ; i <= x; i++)
         {
             scanf("%s",tmp);
             for(int j = ; j <= y; j++)
             {
                 if(tmp[j-]=='Y')
                 {
                     yx = i;
                     yy = j;
                 }
                 if(tmp[j-]=='M')
                 {
                     mx = i;
                     my = j;
                 }
                 g[i][j] = tmp[j-];
             }
         }
         ans = INF;

         node s, t;

         s.x = yx;
         s.y = yy;
         s.step = ;
         q.push(s);
         while(q.size())
         {
             s = q.front();
             q.pop();
             stepA[s.x][s.y] = s.step;
             for(int i = ; i < ; i++)
             {
                 t.x = s.x + d[i][];
                 t.y = s.y + d[i][];
                 t.step = s.step + ;
                 if(stepA[t.x][t.y] != -)    continue;
                 if(g[t.x][t.y]=='.'|| g[t.x][t.y]=='@')
                     q.push(t);
             }
         }
         s.x = mx;
         s.y = my;
         s.step = ;
         q.push(s);
         while(q.size())
         {
             s = q.front();
             q.pop();
             stepB[s.x][s.y] = s.step;
             for(int i = ; i < ; i++)
             {
                 t.x = s.x + d[i][];
                 t.y = s.y + d[i][];
                 t.step = s.step + ;
                 if(stepB[t.x][t.y] != -)    continue;
                 if(g[t.x][t.y]=='.'|| g[t.x][t.y]=='@')
                     q.push(t);
             }
         }
         for(int i = ; i <= x; i++)
         {
             for(int j = ; j <= y; j++)
             {
                 if(g[i][j]=='@' && stepA[i][j]+stepB[i][j]<ans && stepA[i][j]!=- && stepB[i][j]!=-)
                     ans = stepA[i][j]+stepB[i][j];
             }
         }
         cout<<ans*<<endl;
     }

     return ;
 }