【原创】【百度之星2017初赛A】1006 度度熊的01世界

版权声明：未经过作者允许，QωQ是可以转载的，只不过要赞一下本文章并发评论告诉我，然后转载附上原网址就好了！=QωQ= https://blog.csdn.net/c20182030/article/details/77126732

度度熊的01世界

Accepts: 967 Submissions: 3064 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Problem 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

吐槽

哇样例的篇幅好大呀，居然比分析还要长，好羞耻啊！

分析

这道题，因为没有时间了，写了个暴力，感觉回到了我的第一篇博客：Lake Counting，用dfs找到联通块和不被包围的联通块，再判断，就行了。

居然没有超时。

哇，真的比样例还短，太羞耻了！

代码

#include<iostream>
#include<cstring>
#include<cstdio> 
#include<vector> 
#include<cmath>
using namespace std; 

char mmp[123][123];
int n,m,bgm[123][123],c0,c1;
bool isfree[12345][2];

int dx[4]={0,0,1,-1},dy[4]={1,-1,0,0};
void dfs(int x,int y,int k)
{
    if(x<1 || x>n || y<1 || y>m)
    {
        if(k<0) isfree[-k][1]=1;
        else isfree[k][0]=1;
        return ;
    }
    bgm[x][y]=k;
    for(int i=0;i<4;i++)
    {
        int xx=x+dx[i],yy=y+dy[i];
        if(bgm[xx][yy]==0)
            if(mmp[xx][yy]==mmp[x][y]|| xx<1 || xx>n || yy<1 || yy>m)
                dfs(xx,yy,k);
    }
}

int main() 
{
    while(scanf("%d %d\n",&n,&m)!=EOF)
    {
        memset(bgm,0,sizeof bgm);
        memset(isfree,0,sizeof isfree);
        c0=0; c1=0;

        for(int i=1;i<=n;i++)
            scanf("%s",mmp[i]+1);

        for(int i=1;i<=n;i++)
            for(int j=1;j<=m;j++)
                if(bgm[i][j]==0)
                {
                    if(mmp[i][j]=='0') dfs(i,j,++c0);
                    else dfs(i,j,--c1);
                }
        int nofree=0;
        for(int i=1;i<=c0;i++) 
            nofree+=!isfree[i][0];

        if(c1==-1&&nofree==1) puts("0");
        else if(c1==-1&&nofree==0) puts("1");
        else puts("-1");
    }
}