因为是二进制相加,所以通过 与(&) 来判断这面墙在不在。。。
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<string>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<math.h>
#include<set>
using namespace std;
#define N 110
#define LL long long
const LL mod = 0x3f3f3f3f;
int a[N][N];
int vis[N][N];
int sum;
void dfs(int x, int y)
{
if (vis[x][y])return;
sum++;
vis[x][y] = 1;
if ((a[x][y] & 1) == 0)dfs(x, y - 1);
if ((a[x][y] & 2) == 0)dfs(x - 1, y);
if ((a[x][y] & 4) == 0)dfs(x, y + 1);
if ((a[x][y] & 8) == 0)dfs(x + 1, y);
}
int main()
{
int n, m;
int ans = 0, maxn = 0;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
scanf("%d", &a[i][j]);
}
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
if (!vis[i][j])
{
sum = 0;
ans++;
dfs(i, j);
maxn = max(maxn, sum);
}
}
}
cout << ans << endl << maxn << endl;
return 0;
}