用二维数组来保存每个格点的四周是否有墙,对每个连通块进行bfs即可。
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i = a;i<n;i++)
#define per(i,a,n) for(int i = n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define yes cout<<"YES"<<'\n';
#define no cout<<"NO"<<'\n';
#define endl '\n';
#define R register
typedef vector<int> VI;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll MOD=1000000007;
int rnd(int x) {return mrand() % x;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;};
ll lcm(int a,int b){return a*b/gcd(a,b);};
int n,m,ans;
int dx[4]={0,-1,0,1};
int dy[4]={-1,0,1,0};
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n>>m;
vector<vector<array<int,4>>> g(n,vector<array<int,4>>(m));
vector<VI> vis(n,VI(m,0));
rep(i,0,n){
rep(j,0,m){
int x;
cin>>x;
for(int k=3;~k;k--){
if(x&(1<<k)) g[i][j][k]=1;
else g[i][j][k]=0;
}
}
}
int cnt=0;
function<void(int,int)> bfs=[&](int i,int j){
int cur=0;
queue<PII> q;
q.push({i,j});
vis[i][j]=1;
while(!q.empty()){
auto [x,y]=q.front();
q.pop();
cur++;
rep(k,0,4){
if(g[x][y][k]==1) continue;
int xx=x+dx[k],yy=y+dy[k];
if(xx<0||xx>=n||yy<0||y>=m||vis[xx][yy]) continue;
q.push({xx,yy});
vis[xx][yy]=1;
}
}
ans=max(ans,cur);
};
rep(i,0,n){
rep(j,0,m){
if(!vis[i][j]){
bfs(i,j);
cnt++;
}
}
}
cout<<cnt<<'\n'<<ans;
return 0;
}
时间复杂度:O(nm)
空间复杂度:O(nm)