Codeforces1391 D. 505 dp

题意：01矩阵，修改最少的数使偶平方矩阵内的和都为奇数
首先使n<=m, n肯定<= 3，如果为4的话四角的矩阵和肯定是偶数，min==1的话可以特判，因此需要算的就只有n == 2 和 n == 3了；
n == 2时考虑的就是2x2的矩阵平移，观察后会发现答案肯定是一行01或10，一行00或11交替，所以最后整体答案就只有两种，可以暴力一下看那个小；
n == 3时每种排列旁边只有2种合法的排列，dp一下就行

#include <iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#define pb push_back
#define fi first
#define se second
#define sz(x)  x.size()
#define cl(x)  x.clear()
#define all(x)  x.begin() , x.end()
#define rep(i , x , n)  for(ll i = x ; i <= n ; i ++)
#define per(i , n , x)  for(int i = n ; i >= x ; i --)
#define mem(x)  memset(x , 0 , sizeof(x))
#define mem_1(x)  memset(x , -1 , sizeof(x))
#define mem_inf(x)  memset(x , 0x3f3f3f3f , sizeof(x))
#define debug(x)  cout << '*' << x << '\n'
#define ddebug(x , y)  cout << '*' << x << ' ' << y << '\n'
using namespace std ;
typedef long long ll ;
typedef pair<int , int> pii ;
typedef pair<ll , ll> pll ;
const ll mod =  1e9+7;
const ll maxn = 1e6 + 10 ;
const int inf = 0x3f3f3f3f ;
int dp[maxn][8],n,m;
string a[maxn];
vector<int>v,g[10];
void f1()
{
    int a1=0,a2=0;
    for(int i=0;i<v.size();i+=2)
    {
        if(v[i]==0 || v[i]==3)
            a1++;
        if(i+1<v.size() && (v[i+1]==1 || v[i+1]==2))
            a1++;
    }
    for(int i=0;i<v.size();i+=2)
    {
        if(v[i]==1 || v[i]==2)
            a2++;
        if(i+1<v.size() && (v[i+1]==0 || v[i+1]==3))
            a2++;
    }
    cout<<min(a1,a2)<<endl;
}
int ck(int a,int b) {//数一下几个数不一样
    int t=0;
    if((a%2 && !(b%2)) || (!(a%2) && b%2))
        t++;
    a>>=1;b>>=1;
    if((a%2 && !(b%2)) || (!(a%2) && b%2))
        t++;
    a>>=1;b>>=1;
    if((a%2 && !(b%2)) || (!(a%2) && b%2))
        t++;
    return t;
}
void f2()
{
    g[0] = {5,2};g[1] = {4,3};
    g[2] = {7,0};g[3] = {1,6};
    g[4] = {1,6};g[5] = {0,7};
    g[6] = {4,3};g[7] = {5,2};
    for(int i=0;i<8;i++)
        dp[0][i]=ck(i,v[0]);
    for(int i=1;i<m;i++)
        for(int j=0;j<8;j++)
            dp[i][j]=ck(j,v[i]) + min(dp[i-1][g[j][0]], dp[i-1][g[j][1]]);
    int ans=1e9;
    for(int i=0;i<8;i++)
        ans=min(ans,dp[m-1][i]);
    cout<<ans;
}



int main()
{
    cin>>n>>m;
    if(n>=4 && m>=4)
        cout<<-1<<endl;
    else if(n==1 || m==1)
        cout<<0;
    else {
        rep(i,0,n-1)
            cin>>a[i];

        rep(i,0,m-1)
        {
            int t=0;
            rep(j,0,n-1)
            {
                if(j) t<<=1;
                t += a[j][i]-'0';
            }
            v.push_back(t);
        }
        if(n==2)
            f1();
        else f2();

    }
	return 0;

}