HDU 6113 度度熊的01世界 （DFS

度度熊的01世界

Description

度度熊是一个喜欢计算机的孩子，在计算机的世界中，所有事物实际上都只由0和1组成。

现在给你一个n*m的图像，你需要分辨他究竟是0，还是1，或者两者均不是。

图像0的定义：存在1字符且1字符只能是由一个连通块组成，存在且仅存在一个由0字符组成的连通块完全被1所包围。

图像1的定义：存在1字符且1字符只能是由一个连通块组成，不存在任何0字符组成的连通块被1所完全包围。

连通的含义是，只要连续两个方块有公共边，就看做是连通。

完全包围的意思是，该连通块不与边界相接触。

Input

本题包含若干组测试数据。
每组测试数据包含：
第一行两个整数n,m表示图像的长与宽。
接下来n行m列将会是只有01组成的字符画。

满足1<=n,m<=100

Output

如果这个图是1的话，输出1；如果是0的话，输出0，都不是输出-1。

Sample Input

32 32
00000000000000000000000000000000
00000000000111111110000000000000
00000000001111111111100000000000
00000000001111111111110000000000
00000000011111111111111000000000
00000000011111100011111000000000
00000000111110000001111000000000
00000000111110000001111100000000
00000000111110000000111110000000
00000001111110000000111110000000
00000001111110000000011111000000
00000001111110000000001111000000
00000001111110000000001111100000
00000001111100000000001111000000
00000001111000000000001111000000
00000001111000000000001111000000
00000001111000000000000111000000
00000000111100000000000111000000
00000000111100000000000111000000
00000000111100000000000111000000
00000001111000000000011110000000
00000001111000000000011110000000
00000000111000000000011110000000
00000000111110000011111110000000
00000000111110001111111100000000
00000000111111111111111000000000
00000000011111111111111000000000
00000000111111111111100000000000
00000000011111111111000000000000
00000000001111111000000000000000
00000000001111100000000000000000
00000000000000000000000000000000
32 32
00000000000000000000000000000000
00000000000000001111110000000000
00000000000000001111111000000000
00000000000000011111111000000000
00000000000000111111111000000000
00000000000000011111111000000000
00000000000000011111111000000000
00000000000000111111110000000000
00000000000000111111100000000000
00000000000001111111100000000000
00000000000001111111110000000000
00000000000001111111110000000000
00000000000001111111100000000000
00000000000011111110000000000000
00000000011111111110000000000000
00000001111111111111000000000000
00000011111111111111000000000000
00000011111111111111000000000000
00000011111111111110000000000000
00000000001111111111000000000000
00000000000000111111000000000000
00000000000001111111000000000000
00000000000111111110000000000000
00000000000011111111000000000000
00000000000011111111000000000000
00000000000011111111100000000000
00000000000011111111100000000000
00000000000000111111110000000000
00000000000000001111111111000000
00000000000000001111111111000000
00000000000000000111111111000000
00000000000000000000000000000000
3 3
101
101
011

Sample Output

0
1
-1

题解：

在 最外面围一层0后，DFS计算连通块个数

AC代码

#include <bits/stdc++.h>
using namespace std;

#define LL long long
#define CLR(a,b) memset(a,(b),sizeof(a))

const int INF = 0x3f3f3f3f;
const LL INFLL = 0x3f3f3f3f3f3f3f3f;
const int N = 2e3+10;
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, -1, 1};
char mps[N][N];
bool vis[N][N];
int n, m;

bool check(int x,int y)
{
    return x>=0&x<=n&&y>=0&&y<=m&&!vis[x][y];
}
void dfs(int x,int y)
{
    vis[x][y] = true;
    for(int i = 0; i < 4; i++) {
        int xx = x + dx[i];
        int yy = y + dy[i];
        if(check(xx,yy) && mps[xx][yy]==mps[x][y]) {
            vis[xx][yy] = true;
            dfs(xx,yy);
        }
    }

}
int main()
{
    while(~scanf("%d%d",&n,&m)) {
        CLR(vis,false);
        CLR(mps,0);
        int z = 0, zz = 0;
        for(int i = 1; i <= n; i++) {
            scanf("%s",mps[i]+1);
        }
        n++, m++;
        for(int i = 0;i <= n;i++)
            mps[i][0] = mps[i][m] = '0';
        for(int i = 0;i <= m+1;i++)
            mps[0][i] = mps[n][i] = '0';
        for(int i = 0;i <= n;i++) {
            for(int j = 0;j <= m;j++) {
                if(!vis[i][j]) {
                     if(mps[i][j] == '1')
                        zz++;
                    if(mps[i][j] == '0')
                        z++;
                    dfs(i,j);
                }

            }
        }
        if(zz != 1) {
            puts("-1"); continue;
        }
        if(z == 2) puts("0");
        else if(z == 1) puts("1");
        else puts("-1");
    }

return 0;
}