Chessboard

Chessboard

题目

Magnus decided to play a classic chess game. Though what he saw in his locker shocked him! His favourite chessboard got broken into 4 pieces, each of size n by n, n is always odd. And what’s even worse, some squares were of wrong color. j-th square of the i-th row of k-th piece of the board has color ak, i, j; 1 being black and 0 being white.
Now Magnus wants to change color of some squares in such a way that he recolors minimum number of squares and obtained pieces form a valid chessboard. Every square has its color different to each of the neightbouring by side squares in a valid board. Its size should be 2n by 2n. You are allowed to move pieces but not allowed to rotate or flip them.

Input

The first line contains odd integer n (1 ≤ n ≤ 100) — the size of all pieces of the board.
Then 4 segments follow, each describes one piece of the board. Each consists of n lines of n characters; j-th one of i-th line is equal to 1 if the square is black initially and 0 otherwise. Segments are separated by an empty line.

Output

Print one number — minimum number of squares Magnus should recolor to be able to obtain a valid chessboard.

Example

input

3
101
010
101
……
101
000
101
……
010
101
011
……
010
101
010

output

2

思路

由题意需要把棋盘四个碎片，每个碎片的小方格上色，使其和四周的小方块颜色不一样，因此碎片的可能情况只有以下两种（以n=3为例）：
1 0 1
0 1 0
1 0 1
和
0 1 0
1 0 1
0 1 0
并且四个碎片拼起来也要满足如上条件，碎片可以移动。因此四个碎片一定是两个属于第一种情况，两个属于第二种情况。
因此只需要遍历选择任意两个碎片进行第一种涂色，另外两个碎边进行第二种涂色，记录需要涂色的小方块数，进行最小比较即可。

代码

#include <bits/stdc++.h>
using namespace std;
const int Inf=0x3f3f3f3f;
char mag[5][105][105];

int work(int f,int flag,int n)
{
    int ref=0;
    if(flag)
    {
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                if((mag[f][i][j]-'0') != (i+j)%2) continue;
                else ref++;
            }
        }
    }
    if(!flag)
    {
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                if((mag[f][i][j]-'0') == (i+j)%2) continue;
                else ref++;
            }
        }
    }
    return ref;
}

int count(int f1,int f2,int num)
{
    int temp=0;
    temp+=work(f1,1,num);
    temp+=work(f2,1,num);
    for(int i=0;i<4;i++)
    {
        if(i!=f1&&i!=f2)
        {
            temp+=work(i,0,num);
        }
    }
    return temp;
}

int main()
{
    int n;
    while(cin>>n)
    {
        for(int i=0;i<4;i++){
            for(int r=0;r<n;r++){
                for(int c=0;c<n;c++){
                    cin>>mag[i][r][c];
                }
            }
        }

        int ans=Inf;
        for(int i=0;i<4;i++){
            for(int j=0;j<4;j++)
            {
                if(i==j) continue;
                else
                {
                    ans=min(ans,count(i,j,n));
                }
            }
        }
        cout<<ans<<endl;
    }
}