Count_Apartments_II.cpp

#include <bits/stdc++.h>
#define null nullptr
using namespace std;
int n, m;
char ch[1000][1000];
bool vis[1000][1000];
int dx[4] = {0, 0, -1, 1};
int dy[4] = {1, -1, 0, 0};
bool valid(int x, int y)
{
    if (x < 0 || x >= n || y < 0 || y >= m || ch[x][y] == '#')
        return false;
    return true;
}
void dfs(int si, int sj, int &count)
{
    count++;
    vis[si][sj] = true;
    for (int i = 0; i < 4; i++)
    {
        int ci = si + dx[i];
        int cj = sj + dy[i];
        if (valid(ci, cj) && vis[ci][cj] == false)
        {
            dfs(ci, cj, count);
        }
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> m;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            cin >> ch[i][j];
        }
    }
    memset(vis, false, sizeof(vis));
    vector<int> f;
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            if (ch[i][j] != '#' && vis[i][j] == false)
            {
                int count = 0;
                dfs(i, j, count);
                f.push_back(count);
            }
        }
    }
    if(f.empty())
    {
        cout<<0<<endl;
        return 0;
    }
    sort(f.begin(), f.end());
    for (int x : f)
    {
        cout << x << " ";
    }
    return 0;
}