P2372 yyy2015c01挑战算周长

原题链接

和上面一道题一样，甚至更简单了，只要算连通块的周长即可。

不同点是：可以枚举八个方向每次bfs，然后只需要bfs给定点的连通块即可

AC代码

#include <bits/stdc++.h>

#define x first
#define y second
#define rep(i, x) for (int i = 0; i < x; i ++ )
#define repn(i, x) for (int i = 1; i <= x; i ++ )
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};


int tx[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
int ty[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
const int N = 1010;
char g[N][N];
bool st[N][N];
int n, m, X, Y;

int bfs(int sx, int sy)
{
    st[sx][sy] = true;
    queue<PII> q;
    q.push({sx, sy});
    int gir = 0;
    while(q.size())//如何计算周长，对于一个格子来说，它的上面是边界或者是.，那么上面这条边就是边了，否则如果是'#'，那么就不是边了
    {
        auto t = q.front();
        q.pop();
        rep(i, 4)
        {
            int a = t.x + dx[i], b = t.y + dy[i];
            if (a == 0 && b == t.y || a == m + 1 && b == t.y || a == t.x && b == 0 || a == t.x && b == n + 1)  gir ++;
            else if (g[a][b] == '.')    gir ++;
        }
        rep(i, 8)
        {
            int a = t.x + tx[i], b = t.y + ty[i];
            if (a <= 0 || a > m || b <= 0 || b > n || st[a][b] || g[a][b] == '.')   continue;
            st[a][b] = true;
            q.push({a, b});
        }
    }
    return gir;
}

int main()
{
    cin >> m >> n >> X >> Y;
    repn(i, m)   
        repn(j, n)
            cin >> g[i][j];
    
    cout << bfs(X, Y);
    
    return 0;
}