Painter's Problem poj1681 高斯消元法

Painter's Problem

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 4420		Accepted: 2143

Description

There is a square wall which is made of n*n small square bricks. Some bricks are white while some bricks are yellow. Bob is a painter and he wants to paint all the bricks yellow. But there is something wrong with Bob's brush. Once he uses this brush to paint brick (i, j), the bricks at (i, j), (i-1, j), (i+1, j), (i, j-1) and (i, j+1) all change their color. Your task is to find the minimum number of bricks Bob should paint in order to make all the bricks yellow. 

Input

The first line contains a single integer t (1 <= t <= 20) that indicates the number of test cases. Then follow the t cases. Each test case begins with a line contains an integer n (1 <= n <= 15), representing the size of wall. The next n lines represent the original wall. Each line contains n characters. The j-th character of the i-th line figures out the color of brick at position (i, j). We use a 'w' to express a white brick while a 'y' to express a yellow brick.

Output

For each case, output a line contains the minimum number of bricks Bob should paint. If Bob can't paint all the bricks yellow, print 'inf'.

Sample Input

2
3
yyy
yyy
yyy
5
wwwww
wwwww
wwwww
wwwww
wwwww

Sample Output

0
15

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <string.h>
#include <set>
using namespace std;
const int MAXN=300;
int a[MAXN][MAXN];
int x[MAXN];
bool free_x[MAXN];
inline int gcd(int a,int b)
{
    int t;
    while(b!=0)
    {
        t=b;
        b=a%b;
        a=t;
    }
    return a;
}
inline int lcm(int a,int b)
{
    return a/gcd(a,b)*b;
}
int Gauss(int equ,int var)
{
    int i,j,k;
    int max_r;
    int col;
    col=0;
    for(k = 0; k < equ && col < var; k++,col++)
    {
        max_r=k;
        for(i=k; i<equ; i++)
        {
            if(a[i][col])
            {
                max_r=i;
                break;
            }
        }
        if(max_r!=k)
        {
            for(j=k; j<var+1; j++) swap(a[k][j],a[max_r][j]);
        }
        if(a[k][col]==0)
        {
            k--;
            continue;
        }
        for(i=0; i<equ; i++)
        {
            if(i!=k&&a[i][col]!=0)
            {
                for(j=0; j<var+1; j++)
                {
                    a[i][j]^= a[k][j];
                }
            }
        }
    }
    for (i = k; i < equ; i++)
    {
        if (a[i][col] != 0) return 0;
    }
    return 1;
}
int main()
{
    int n,m,t,i,j;
    cin>>t;
    char x;
    while(t--)
    {
        memset(a,0,sizeof(a));
        cin>>n;
        m=n*n;
        for(i=0; i<m; i++)
        {
            if(i%n==0)getchar();
            x=getchar();
            if(x!='y')a[i][m]=1;
        }
        for(i=0; i<m; i++)
        {
            a[i][i]=1;
            if(i-n>=0)
                a[i][i-n]=1;
            if(i+n<m)
                a[i][i+n]=1;
            if(i%n)
                a[i][i-1]=1;
            if((i+1)%n)
                a[i][i+1]=1;
        }
        if(!Gauss(m,m))cout<<"inf"<<endl;
        else
        {
            int ans=0;
            for(i=0; i<m; i++)ans+=a[i][m]&1;
            cout<<ans<<endl;
        }
    }
}