输入
7 .......
.##....
.##....
....##.
..####.
...###.
.......
输出
1
计算每个连通块中陆地的数量和与海洋相邻的陆地数量是否相等
#include <iostream>
#include <bits/stdc++.h>
#include <cstring>
#include <vector>
#include <unordered_map>
#include <queue>
#include <set>
#define int long long
#include <algorithm>
#define x first
#define y second
#define pb emplace_back
#define fu(i,a,b) for(int i=a;i<=b; ++ i)
#define fd(i,a,b) for(int i=a;i>=b; -- i)
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<vector<LL>> VVL;
typedef vector<vector<int>> VVI;
typedef vector<LL> VL;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef pair<PII,int> PIII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<int,char> PIC;
typedef pair<LL,LL> PLL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N =1e3 + 10,M = N * 5,base =400 ,INF = 0x3f3f3f3f,P = 131;
const double eps = 1e-8;
const int mod = 998244353;
const LL LNF=(LL) INF * INF;
int n;
char g[N][N];
int dx[]={-1,0,1,0},dy[] = {0,-1,0,1};
bool st[N][N];
PII q[N * N ];
// c1 陆地个数,c2 与海洋连接的的陆地数量
bool bfs(int a,int b)
{
int hh = 1, tt = 1;
int c1 =0 ,c2 = 0;
q[1] = {a,b };
st[a][b] = 1;
while(hh <= tt)
{
PII t = q[hh ++ ]; c1 ++ ;
bool f = 0; // 是否与海洋连接
fu(i,0,3)
{
int x = t.x+ dx[i],y = t.y+ dy[i];
if(x < 0 || x >= n || y < 0 || y >= n || st[x][y]) continue;
if(g[x][y] == '.') // 与海洋连接
{
f=1 ;continue;
}
q[++tt] = {x,y};
st[x][y] = 1 ;
}
if(f) c2 ++ ;
}
return c1 == c2 ;
}
inline void solve()
{
cin >> n;
fu(i,0,n-1) cin >> g[i];
int ans = 0;
fu(i,0,n-1)
fu(j,0,n-1)
if(g[i][j]== '#' && !st[i][j])
{
ans += bfs(i,j);
}
cout << ans <<endl;
}
signed main()
{
// freopen("1.txt","r",stdin);
// #define int long long
// init(N-1);
ios
// cout << fixed<<setprecision(2);
int t=1;
// cin>>t;
int now = 1;
while(t -- )
{
// cout<<"Case ";
// cout<<"Case #";
// cout<<"Scenario #";
// cout<< now ++ <<": ";
// cout<< now ++ <<": \n";
solve();
}
return 0;
}