状态压缩 codeforces 1391 D

D. 505
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
A binary matrix is called good if every even length square sub-matrix has an odd number of ones.

Given a binary matrix a consisting of n rows and m columns, determine the minimum number of cells you need to change to make it good, or report that there is no way to make it good at all.

All the terms above have their usual meanings — refer to the Notes section for their formal definitions.

Input
The first line of input contains two integers n and m (1≤n≤m≤106 and n⋅m≤106) — the number of rows and columns in a, respectively.

The following n lines each contain m characters, each of which is one of 0 and 1. If the j-th character on the i-th line is 1, then ai,j=1. Similarly, if the j-th character on the i-th line is 0, then ai,j=0.

Output
Output the minimum number of cells you need to change to make a good, or output −1 if it’s not possible at all.

状态压缩

二进制数的每个数位上的1或者0用来表示一种情况的状态开或者闭，10,01,110，可以表示不同种的情况的状态的开闭情况的组合，可以用简单的操作表示出许许多多的情况。这样结合数位运算操作可以办很多事。

min（n,m）为3的情况与为2的情况类似。

网上大佬的代码

#include <bits/stdc++.h>

using namespace std;
const int N = 5e5+1;
int n,m;
int a[4][N];
int dp3[N][8];
int dp2[N][4];
bool ok3[8][8];
bool ok2[4][4];

void fill3(){
	for(int i = 0;i < 8;i++){
		for(int j = 0;j < 8;j++){
			bool bad = 0;
			for(int st = 0;st < 2;st++){
				int bits = (bool)(i&(1<<st))+(bool)(i&(1<<(st+1)));
				bits += (bool)(j&(1<<st))+(bool)(j&(1<<(st+1)));
				if(bits%2 == 0){
					bad = 1;
				}
			}
			if(!bad){
				ok3[i][j] = 1;
			}
		}
	}
}

void fill2(){
	for(int i = 0;i < 4;i++){
		for(int j = 0;j < 4;j++){
			bool bad = 0;
			for(int st = 0;st < 1;st++){
				int bits = (bool)(i&(1<<st))+(bool)(i&(1<<(st+1)));
				bits += (bool)(j&(1<<st))+(bool)(j&(1<<(st+1)));
				if(bits%2 == 0){
					bad = 1;
				}
			}
			if(!bad){
				ok2[i][j] = 1;
			}
		}
	}
}


void solve2(){
	for(int i = 1;i <= m;i++){
		int mask = a[1][i]+2*a[2][i];
		for(int cur = 0;cur < 4;cur++){
			dp2[i][cur] = 1e9;
			for(int prev = 0;prev < 4;prev++){
				if(!ok2[prev][cur])continue;
				dp2[i][cur] = min(dp2[i][cur],dp2[i-1][prev]+__builtin_popcount(cur^mask));
			}
		}
	}
	int ans = 1e9;
	for(int i = 0;i < 4;i++)ans = min(ans,dp2[m][i]);
	cout << ans;
}

void solve3(){
	for(int i = 1;i <= m;i++){
		int mask = a[1][i]+2*a[2][i]+4*a[3][i];
		for(int cur = 0;cur < 8;cur++){
			dp3[i][cur] = 1e9;
			for(int prev = 0;prev < 8;prev++){
				if(!ok3[prev][cur])continue;
				dp3[i][cur] = min(dp3[i][cur],dp3[i-1][prev]+__builtin_popcount(cur^mask));
			}
		}
	}
	int ans = 1e9;
	for(int i = 0;i < 8;i++)ans = min(ans,dp3[m][i]);
	cout << ans;
}

void solve(){
	cin >> n >> m;
	if(min(n,m) > 3){
		cout << -1;
		return;
	}
	if(min(n,m) == 1){
		cout << 0;
		return;
	}
	for(int i = 1;i <= n;i++){
		for(int j = 1;j <= m;j++){
			char o;cin >> o;
			a[i][j] = o-'0';
		}
	}
	if(n == 3)solve3();
	else solve2();
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	fill2();
	fill3();
	solve();
	return 0;
}