bzoj2252: [2010Beijing wc]矩阵距离

将1加入队列，然后随便搜…

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
queue<int> qx;
queue<int> qy;
int read()
{
    char ch=getchar();int f=0;
    while(ch<'0'||ch>'9')ch=getchar();
    while(ch>='0'&&ch<='9'){f=(f<<1)+(f<<3)+ch-'0';ch=getchar();}
    return f;
}
int n,m,dis[1005][1005],a[1005][1005];char s[1005][1005];
int movex[5]={0,1,-1,0,0},movey[5]={0,0,0,1,-1};
void bfs()
{
    while(!qx.empty())
    {
        int x=qx.front(),y=qy.front();
        qx.pop();qy.pop();
        for(int i=1;i<=4;i++)
        {
            if(x+movex[i]>=1&&x+movex[i]<=n&&y+movey[i]>=1&&y+movey[i]<=m)
            {
                if(dis[x+movex[i]][y+movey[i]]>dis[x][y]+1)
                {
                    dis[x+movex[i]][y+movey[i]]=dis[x][y]+1;
                    qx.push(x+movex[i]);
                    qy.push(y+movey[i]);
                }
            }
        }
    }
}
int main()
{
    memset(dis,0x7f7f7f7f,sizeof(dis));
    n=read();m=read();
    for(int i=1;i<=n;i++)
    {
        scanf("%s",s[i]+1);
        for(int j=1;j<=m;j++)
        {
            a[i][j]=s[i][j]-'0';
            if(a[i][j]==1)
            {
                dis[i][j]=0;
                qx.push(i);
                qy.push(j);
            }
        }
    }
    bfs();
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            printf("%d ",dis[i][j]);
        }
        puts("");
    }
}