11464 - Even Parity（偶数矩阵）

D

Even Parity Input: Standard Input Output: Standard Output

We have a grid of size N x N. Each cell of the grid initially contains a zero(0) or a one(1). 
The parity of a cell is the number of 1s surrounding that cell. A cell is surrounded by at most 4 cells (top, bottom, left, right).

Suppose we have a grid of size 4 x 4: 

 

1	0	1	0	The parity of each cell would be	1	3	1	2
1	1	1	1		2	3	3	1
0	1	0	0		2	1	2	1
0	0	0	0		0	1	0	0

 

 

 

 

 

 

For this problem, you have to change some of the 0s to 1s so that the parity of every cell becomes even. We are interested in the minimum number of transformations of 0 to 1 that is needed to achieve the desired requirement.

 

Input

The first line of input is an integer T (T<30) that indicates the number of test cases. Each case starts with a positive integer N(1≤N≤15). Each of the next N lines contain N integers (0/1) each. The integers are separated by a single space character.

 

Output

For each case, output the case number followed by the minimum number of transformations required. If it's impossible to achieve the desired result, then output -1 instead.

 

Sample Input                             Output for Sample Input

3 3 0 0 0 0 0 0 0 0 0 3 0 0 0 1 0 0 0 0 0 3 1 1 1 1 1 1 0 0 0

Case 1: 0  Case 2: 3  Case 3: -1

---

Problem Setter: Sohel Hafiz,

Special Thanks: Derek Kisman, Md. Arifuzzaman Arif

/*
n不大最大到15，第一行只有2^15=32768种可能，所以枚举第一行的情况是可以枚举的，
接下来根据第一行可以完全计算第二行，根据第二行计算第三行，这样下去时间复杂度O(2^n*n^2).
*/
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int N=20;
const int INF=1000000000;
int n,mapa[N][N],flag[N][N];
int min_value(int a,int b)
{
	return a<b?a:b;
}
int check(int s)
{
	memset(flag,0,sizeof(flag));
	int i,j;
	for(i=0;i<n;i++)
	{
		if(s&(1<<i)) flag[0][i]=1;
		else if(mapa[0][i]==1) return INF;//是否只改变零能的到枚举的数。
	}
	for(i=1;i<n;i++)
	{
		for(j=0;j<n;j++)
		{
			int sum=0;
			if(i>1) sum+=flag[i-2][j];
			if(j>0) sum+=flag[i-1][j-1];
			if(j<n-1) sum+=flag[i-1][j+1];
			flag[i][j]=sum%2;
			if(mapa[i][j]==1&&flag[i][j]==0) return INF;//计算枚举各行只把0改变1，如果不合结束
		}
	}
	int cnt=0;
	for(i=0;i<n;i++)
	{
		for(j=0;j<n;j++)
		{
			if(mapa[i][j]!=flag[i][j]) cnt++;//计算0的改变量
		}
	}
	return cnt;
}
int main()
{
    int T,dk=1;
	cin>>T;
	while(T--)
	{
		cin>>n;
		int i,j;
		for(i=0;i<n;i++)
		{
			for(j=0;j<n;j++)
			{
				cin>>mapa[i][j];
			}
		}
		int ans=INF;
		for(int s=0;s<(1<<n);s++)//枚举第一行所有可能
		{
			ans=min_value(ans,check(s));
		}
		if(ans==INF) ans=-1;
		printf("Case %d: %d\n",dk++,ans);
	}
	return 0;
}