【连通块+bfs】F - Paint the Grid Reloaded ZOJ - 3781

F - Paint the Grid Reloaded ZOJ - 3781

Leo has a grid with N rows and M columns. All cells are painted with either black or white initially.

Two cells A and B are called connected if they share an edge and they are in the same color, or there exists a cell C connected to both Aand B.

Leo wants to paint the grid with the same color. He can make it done in multiple steps. At each step Leo can choose a cell and flip the color (from black to white or from white to black) of all cells connected to it. Leo wants to know the minimum number of steps he needs to make all cells in the same color.

Input

There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

The first line contains two integers N and M (1 <= N, M <= 40). Then N lines follow. Each line contains a string with N characters. Each character is either 'X' (black) or 'O' (white) indicates the initial color of the cells.

Output

For each test case, output the minimum steps needed to make all cells in the same color.

Sample Input

2
2 2
OX
OX
3 3
XOX
OXO
XOX

Sample Output

1
2

Hint

For the second sample, one optimal solution is:

Step 1. flip (2, 2)

XOX
OOO
XOX

Step 2. flip (1, 2)

XXX
XXX
XXX

给你一个n*m的矩阵，要么黑要么白

你每次可以选择以一个格子开始的同色四连通连通块一起变颜色

问你最少要几步变成全黑或者全白的矩阵

 

先dfs图直接连通块染色，四连通的连通块中的格子染同一种颜色

然后相邻连通块直接建边

以每个连通块为起点跑bfs，更新答案

#include <bits/stdc++.h>
using namespace std;
int n,m;
char a[45][45];
int b[45][45],walk[4][2]= {{0,1},{0,-1},{1,0},{-1,0}};
int col[45][45],vis[1605],color;
struct point
{
    int x,y;
};
vector <int> G[1605];
vector <point> s[1605];

struct node
{
    int to,step;
};

void dfs(int x,int y,int k,int f)
{
    col[x][y]=k;

    for(int i=0; i<4; i++)
    {
        int xx=x+walk[i][0],yy=y+walk[i][1];
        if(xx>=1&&xx<=n&&yy>=1&&yy<=m&&!col[xx][yy]&&b[xx][yy]==f)
        {
            dfs(xx,yy,k,f);
        }
    }
}

bool check(int x,int y)
{
    if(x>=1&&x<=n&&y>=1&&y<=m) return 1;
    return 0;
}


int bfs(int x)
{
    int maxx=0;
    memset(vis,0,sizeof vis);
    queue <node> q;
    node p;
    p.step=0,p.to=x;
    vis[x]=1;
    q.push(p);
    while(!q.empty())
    {
        node e=q.front();
        q.pop();
        maxx=max(maxx,e.step);
        for(auto v:G[e.to])
        {
            node ee;
            ee.step=e.step+1;
            if(!vis[v])
            {
                vis[v]=1;
                ee.to=v;
                q.push(ee);
            }
        }
    }
    return maxx;
}

void print()
{
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
            cout<<col[i][j];
        cout<<endl;
    }
}

void jianbian()
{
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            for(int k=0;k<4;k++)
            {
                int x=i+walk[k][0],y=j+walk[k][1];
                if(check(x,y)&&col[i][j]!=col[x][y])
                {
                    G[col[i][j]].push_back(col[x][y]);
                    G[col[x][y]].push_back(col[i][j]);
                }
            }
        }
    }

}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        memset(col,0,sizeof(col));
        scanf("%d%d",&n,&m);
        for(int i=1; i<=n; i++)
            scanf("%s",a[i]+1);
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=m; j++)
            {
                if(a[i][j]=='O') b[i][j]=0;
                else b[i][j]=1;
            }
        }

        color=0;
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=m; j++)
            {
                if(!col[i][j])
                {
                    dfs(i,j,++color,b[i][j]);
                }
            }
        }

        jianbian();
//        for(int i=1;i<=color;i++)
//        {
//            printf("%d\n",i);
//            for(auto x:G[i])
//            {
//                printf("%d %d\n",i,x);
//            }
//        }

        int ans=1e9;
        for(int i=1;i<=color;i++)
        {
            int num=bfs(i);
           // if(num<=40) cout<<i<<" "<<num<<endl;
            ans=min(ans,num);
        }
        printf("%d\n",ans);

        for(int i=0;i<=color;i++)
        {
            G[i].clear();
          //  s[i].clear();
        }

    }
    return 0;
}
/*
100
40 40
XOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXO
OXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOX
XOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXO
OXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOX
XOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXO
OXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOX
XOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXO
OXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOX
XOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXO
OXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOX
XOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXO
OXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOX
XOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXO
OXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOX
XOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXO
OXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOX
XOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXO
OXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOX
XOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXO
OXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOX
XOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXO
OXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOX
XOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXO
OXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOX
XOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXO
OXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOX
XOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXO
OXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOX
XOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXO
OXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOX
XOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXO
OXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOX
XOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXO
OXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOX
XOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXO
OXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOX
XOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXO
OXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOX
XOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXO
OXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOXOX

*/