百练 2813:画家问题

http://bailian.openjudge.cn/practice/2813/

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int t = 0,n = 0;
char ch[20];
bool c[20][20] = {0},p[20][20] = {0},map[20][20] = {0};
void changeMap(int a, int b){
    p[a][b] = !p[a][b];
    p[a-1][b] = !p[a-1][b];
    p[a+1][b] = !p[a+1][b];
    p[a][b-1] = !p[a][b-1];
    p[a][b+1] = !p[a][b+1];
}
int main(){
    scanf("%d",&t);
    while(t--){
        int sum=0;
        scanf("%d",&n);
        int min=n*n+1;
        for(int i=1;i<=n;++i){
            scanf("%s",ch);
            for(int j=1;j<=n;++j){//把这行字符串换成01
                if(ch[j-1]=='y') c[i][j]=1;
                else c[i][j]=0;
            }
        }
        for(int k=0;k<pow(2,n);k++){
			int i;
            for(i=1;i<=n;i++)
                for(int j=1;j<=n;j++){
                    p[i][j] = c[i][j];
                }
            for(i=1;i<=n;i++){
                map[1][i]=(k>>(i-1))&1;
                if(map[1][i]){
                    changeMap(1,i);
                    sum++;
                }
            }
            for(i=2;i<=n;i++)
                for(int j=1;j<=n;j++)
                    if(!p[i-1][j]){
                        map[i][j]=1;
                        sum++;
                        changeMap(i,j);
                    }
            int mark=0;
            for(int j=1;j<=n;j++)
                if(!p[n][j]) mark=1;
            if(!mark && sum<min) min=sum;
            sum = 0;
        }
        if(min != n*n+1) printf("%d\n",min);
        else printf("inf\n");
    }
    return 0;
}