突然发现之前这道题目没过
只要找出所有的0,1连通块,然后按条件输出就行了
如果0连通块的边界是整个图的边界即说明这个0连通块没有被1连通块包围
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <queue>
using namespace std;
const int N = 101;
int dir[4][2] = {0,1,1,0,0,-1,-1,0};
int n, m, vis[N][N], flag;
char mp[N][N];
typedef pair<int, int> pii;
void bfs(int x, int y){
queue<pii>q;
q.push(make_pair(x, y));
vis[x][y] = 1;
while(!q.empty()){
x = q.front().first;
y = q.front().second;
q.pop();
for(int i=0;i<4;i++) {
int xx = x + dir[i][0];
int yy = y + dir[i][1];
if(xx < 1 || xx > n || yy < 1 || yy > m){
flag = 0;
continue;
}
if(vis[xx][yy] || mp[xx][yy] != mp[x][y]) continue;
q.push(make_pair(xx, yy));
vis[xx][yy] = 1;
}
}
}
int main()
{
while(scanf("%d%d", &n, &m)!=EOF) {
for(int i=1;i<=n;i++) scanf("%s", mp[i]+1);
memset(vis, 0, sizeof vis);
int one = 0, zero = 0; // one为1连通块个数,zero为被1包围的0连通块个数
for(int i=1;i<=n;i++) {
for(int j=1;j<=m;j++) {
if(vis[i][j]) continue;
if(mp[i][j] == '1') one ++;
else flag = 1;
bfs(i, j);
zero += flag;
}
}
if(one == 1 && zero == 0) puts("1");
else if(one == 1 && zero == 1) puts("0");
else puts("-1");
}
return 0;
}