Transform To Chessboard Problem


Description

LeetCode Problem 782.

You are given an n x n binary grid board. In each move, you can swap any two rows with each other, or any two columns with each other.

Return the minimum number of moves to transform the board into a chessboard board. If the task is impossible, return -1.

A chessboard board is a board where no 0’s and no 1’s are 4-directionally adjacent.

Example 1:

1
2
3
4
5
Input: board = [[0,1,1,0],[0,1,1,0],[1,0,0,1],[1,0,0,1]]
Output: 2
Explanation: One potential sequence of moves is shown.
The first move swaps the first and second column.
The second move swaps the second and third row.

Example 2:

1
2
3
Input: board = [[0,1],[1,0]]
Output: 0
Explanation: Also note that the board with 0 in the top left corner, is also a valid chessboard.

Example 3:

1
2
3
Input: board = [[1,0],[1,0]]
Output: -1
Explanation: No matter what sequence of moves you make, you cannot end with a valid chessboard.

Constraints:

  • n == board.length
  • n == board[i].length
  • 2 <= n <= 30
  • board[i][j] is either0 or 1.


Sample C++ Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
class Solution {
public:
    int movesToChessboard(vector<vector<int>>& board) {
        int N = board.size(), row_bal = 0, col_bal = 0, c = 0, d = 0;
        for (int i = 0; i < N; ++i) {
            row_bal += board[0][i] ? 1 : -1;
            col_bal += board[i][0] ? 1 : -1;
            if (i & 1) {
                c += board[0][i];
                d += board[i][0];
            }
        }
        if (row_bal > 1 || row_bal < -1 || col_bal > 1 || col_bal < -1)     
            return -1;
        for (int i = 1; i < N; ++i)
            for (int j = 1; j < N; ++j)
                if (board[i][j] ^ board[i][0] ^ board[0][j] ^ board[0][0])      
                    return -1;
        
        if (!row_bal)      
            return min(N / 2 - c, c) + min(N / 2 - d, d);
        else        
            return (row_bal > 0 ? c : N / 2 - c) + (col_bal > 0 ? d : N / 2 - d);
    }
};




Related Posts

Three Equal Parts Problem

LeetCode 927. You are given an array arr which consists...

Surface Area Of 3D Shapes Problem

LeetCode 892. You are given an n x n grid...

Super Palindromes Problem

LeetCode 906. Let’s say a positive integer is a super-palindrome...

Smallest Range I Problem

LeetCode 908. You are given an integer array nums and...

Projection Area Of 3D Shapes Problem

LeetCode 883. You are given an n x n grid...

Prime Palindrome Problem

LeetCode 866. Given an integer n, return the smallest prime...