#include<iostream>
#include<cstring>
int Room[55][55],Color[55][55];
int RoomNum=0,RoomArea=0,MaxRoomArea=0;
using namespace std;
void dfs(int i,int j){
if(Color[i][j])
return ;
RoomArea++;
Color[i][j]=RoomNum;
if((Room[i][j]&1)==0) dfs(i,j-1);
if((Room[i][j]&2)==0) dfs(i-1,j);
if((Room[i][j]&4)==0) dfs(i,j+1);
if((Room[i][j]&8)==0) dfs(i+1,j);
}
int main(){
int r,c;
cin>>r>>c;
for(int i=1;i<=r;i++)
for(int j=1;j<=c;j++)
cin>>Room[i][j];
memset(Color,0,sizeof(Color));
for(int i=1;i<=r;i++)
for(int j=1;j<=c;j++){
if(!Color[i][j]){
++RoomNum;
RoomArea=0;
dfs(i,j);
MaxRoomArea=max(RoomArea,MaxRoomArea);
}
}
cout<<RoomNum<<endl<<MaxRoomArea<<endl;
return 0;
}
城堡问题
最新推荐文章于 2023-12-27 18:03:27 发布