P1683 入门

原题链接

模板：问你连通块中点的个数，出队一次记录+1即可

#include <bits/stdc++.h>
#define x first
#define y second
#define rep(i,n) for(int i = 0; i < n; i ++ )

using namespace std;

const int N = 22;
typedef pair<int, int> PII;
char g[N][N];
int n, m;
bool st[N][N];
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
int cnt;

int bfs(int sx, int sy)
{
    queue<PII> q;
    st[sx][sy] = true;
    q.push({sx, sy});
    
    while(q.size())
    {
        auto t = q.front();
        q.pop();
        cnt ++;
        rep(i, 4)
        {
            int a = t.x + dx[i], b = t.y + dy[i];
            if (a < 0 || a >= n || b < 0 || b >= m || g[a][b] == '#' || st[a][b])   continue;
            st[a][b] = true;
            q.push({a, b});
        }
    }
    return cnt;
}


int main()
{
    cin >> m >> n;
    int sx, sy;
    rep(i, n)
        rep(j, m)
        {
            cin >> g[i][j];
            if(g[i][j] == '@')
            sx = i, sy = j;
        }
        
    cout << bfs(sx, sy) << endl;
    
    return 0;
}