HihoCoder

我的搜索真的很垃圾
我嘴上会说很讨厌这种傻逼求职刷题网站,因为他们的题目都是暴力,单纯恶心的写代码,但是其实我心里明白只是因为我自己菜而已.
hihocoder的题目的题解,都给人一种不专业的感觉,我想不是我的幻觉,这个bfs的题目,我写搜索是真的不会,这篇还是详细一点吧
这题最骚的地方就是他从所有水域开始同时搜,这一点是我以前没有想过的,因为这样就像是病毒扩散,距离永远是最低,如果从每一个陆地开始bfs,就是每一次还要重新置零,效率及其低下了.

/*  xzppp  */#include <iostream>#include <vector>#include <set>#include <queue>#include <map>#include <algorithm>#include <stdio.h>#include <string.h>#include <list>#include <math.h>#include <iomanip>using namespace std;#define FFF freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);#define lson l,m,rt<<1#define rson m+1,r,rt<<1|1#define MP make_pairtypedef long long  LL;typedef unsigned long long ULL;const int MAXN = 800;const int  INF = 0x7fffffff;const int MOD = 1e9+7;char mp[MAXN+17][MAXN+17];int ans[MAXN+17][MAXN+17];int dir[4][2]={-1,0,1,0,0,1,0,-1};int main(){    //FFF    int m,n;    cin>>n>>m;    for (int i = 0; i < n; ++i)        scanf("%s",mp[i]);    queue <pair<int ,int > > q;    for (int i = 0; i < n; ++i)        for (int j = 0; j < m; ++j)        {            if(mp[i][j]=='0')            {                q.push(MP(i,j));                ans[i][j] = 0;            }            else                ans[i][j] = INF;        }    while(!q.empty())    {        int nx = q.front().first,ny = q.front().second;        q.pop();        for (int i = 0; i < 4; ++i)        {            int gx = nx+dir[i][0],gy = ny+dir[i][1];            if(gx>-1&&gx<n&&gy>-1&&gy<m&&ans[gx][gy]==INF)            {                ans[gx][gy] = ans[nx][ny]+1;                q.push(MP(gx,gy));            }        }    }    for (int i = 0; i < n; ++i)        for (int j = 0; j < m; ++j)            printf("%d%c",ans[i][j],j==m-1?'\n':' ');    return 0;}