二分图_HDU_1045

/*
二分图的构造
拆行、拆列
*/
#include<iostream>
#include<cstdio>
#include<cstring>
const int maxn = 10;
using namespace std;
char map[maxn][maxn];
int n;
int link[maxn*maxn],vis[maxn*maxn];
int col[maxn], row[maxn];
struct node
{
    int x,y;
}g[maxn][maxn];
int dp[maxn*maxn][maxn*maxn];
int r,c;
int can(int x)
{
    for(int i = 1; i <= c; i++)
    {
        if(dp[x][i]!=0&&!vis[i])
        {
            vis[i] = 1;
            if(link[i]==-1||can(link[i]))
            {
                link[i] = x;
                return 1;
            }
        }
    }
    return 0;
}
int chare(int x, int y)
{
    if(y-1<1)return 0;
    if(y+1>n)return 0;
    if(map[x][y-1]=='.' && map[x][y+1]=='.')
        return 1;
    return 0;
}
int chareh(int x, int y)
{
    if(x-1<1)return 0;
    if(x+1>n)return 0;
    if(map[x-1][y]=='.' && map[x+1][y]=='.')
        return 1;
    return 0;
}
int main()
{

    //freopen("input.txt","r",stdin);
    int ret;
    while(scanf("%d",&n)!=EOF)
    {
        if(n == 0)break;
        memset(g,0,sizeof(g));
        for(int i = 1; i <= n; i++)
            col[i] = i;
        memset(row, 0, sizeof(row));
        memset(link, -1,sizeof(link));
        memset(g, 0,sizeof(g));
        memset(dp, 0,sizeof(dp));
        ret = 0;
        for(int i = 1; i <= n; i++)
            scanf("%s",map[i]+1);
        c = n,r = 0;
        for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j <= n; j++)
            {
                if(map[i][j] == 'X')
                {
                    if(j != 1)
                    {
                        if(chare(i,j))
                            r++;

                    }
                    if(i != 1)
                    {
                        if(chareh(i,j))
                        {
                            c++;
                            col[j]=c;
                        }
                    }
                }
                else
                {
                    g[i][j].x = i+r;
                    g[i][j].y = col[j];
                    dp[i+r][col[j]] = 1;
                }
            }
        }
       /* for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j <= n; j++)
            {
                printf("(%d,%d) ",g[i][j].x, g[i][j].y);
            }
            printf("\n");
        }*/
        r += n;
        /*for(int i = 1; i <= r; i++)
        {
            for(int j = 1; j <= c; j++)
                printf("%d ",dp[i][j]);
            puts("");
        }*/
        ret = 0;
        for(int i = 1; i <= r; i++)
        {
            memset(vis, 0, sizeof(vis));
            if(can(i))
                ret++;
        }
        printf("%d\n",ret);
    }
    return 0;
}
/*
4
..X.
X...
..XX
.X..
*/