poj 3026 brog maze bfs+prim 好坑爹的数据= =

题目连接：http://poj.org/problem?id=3026

这题数据太坑了。。。不看解题报告不知道。。。尼玛，m,n后面不能加getchar（），得加gets(s);尼玛是有多少个空格啊~wa了N遍啊

思路 先求点，然后对每一个点进行一次bfs，然后存距离，之后直接最小生成树。一开始我是用两个for循环去的值，直接超时。。。

代码：

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

using namespace std;
struct node
{
    int x,y;
}p[5005];
struct queue
{
    int x,y,step;
}q[100005];
int m,n,to[4][2]={{1,0},{-1,0},{0,1},{0,-1}};
int map[505][505];
char str[505][505];
int hash[505][505] = {0};
int is_in(struct queue temp)
{
    if(temp.x >= 0 && temp.x < n && temp.y >= 0 && temp.y < m )
    {
        return 1;
    }
    return 0;
}

void bfs(int s)
{
    int vis[505][505] = {0};
    int f,r,i;
    f = r = 0;
    q[f].x = p[s].x;
    q[f].y = p[s].y;
    q[f].step = 0;
    vis[p[s].x][p[s].y] = 1;
    r++;
    while( f<r )
    {
        struct queue temp;
        temp = q[f++];
        for(i = 0;i < 4;i++)
        {
            struct queue now;
            now.x = temp.x+to[i][0];
            now.y = temp.y+to[i][1];
            now.step = temp.step+1;
            if(is_in(now)&&str[now.x][now.y] != '#' &&!vis[now.x][now.y])
            {
                q[r++] = now;
                vis[now.x][now.y] = 1;
                if(str[now.x][now.y] != ' ')
                map[s][hash[now.x][now.y]] = map[hash[now.x][now.y]][s] = now.step;
            }
        }
    }
}
 int prim(int sn)
 {
     int i,j,primer,ans,min;
     int vis[505] = {0};
     int d[505];
     ans = 0;
     for(i = 0;i < sn;i++)
     d[i] = map[0][i];
     vis[0] = 1;

     for(i = 1;i < sn;i++)
     {
         min = 9999999;
         for(j = 1;j < sn;j++)
         {
             if(min > d[j]&& !vis[j])
             min = d[j],primer = j;
         }
         ans += min;
         vis[primer] = 1;
         for(j = 1;j < sn;j++)
         if(d[j] > map[primer][j] && !vis[j])
         d[j] = map[primer][j];
     }
     return ans;
 }
int main()
{
    int t,i,j,count;
    scanf("%d",&t);
    while(t--)
    {
        memset(hash,0,sizeof(hash));
        scanf("%d %d",&m,&n);
        char s[500];
        gets(s);
        for(i = 0;i < n;i++)
        {
            gets(str[i]);
        }
        count = 0;
        for(i = 0;i < n;i++)
        {
            for(j = 0;j < m;j++)
            if(str[i][j] != '#' && str[i][j] != ' ' )
            {
                p[count].x = i;
                p[count].y = j;
                hash[i][j] = count;
                count++;
            }
        }

        for(i = 0;i < count;i++)
        {
            bfs(i);
        }
        printf("%d\n",prim(count));
    }
    return 0;
}