POJ2965(枚举)

POJ2965(枚举)

---

The Pilots Brothers’ refrigerator

The Pilots Brothers’ refrigerator
Description
The game “The Pilots Brothers: following the stripy elephant” has a quest where a player needs to open a refrigerator.
There are 16 handles on the refrigerator door. Every handle can be in one of two states: open or closed. The refrigerator is open only when all handles are open. The handles are represented as a matrix 4х4. You can change the state of a handle in any location [i, j] (1 ≤ i, j ≤ 4). However, this also changes states of all handles in row i and all handles in column j.
The task is to determine the minimum number of handle switching necessary to open the refrigerator.
Input
The input contains four lines. Each of the four lines contains four characters describing the initial state of appropriate handles. A symbol “+” means that the handle is in closed state, whereas the symbol “−” means “open”. At least one of the handles is initially closed.
Output
The first line of the input contains N – the minimum number of switching. The rest N lines describe switching sequence. Each of the lines contains a row number and a column number of the matrix separated by one or more spaces. If there are several solutions, you may give any one of them.
Sample Input

“-±-”

“----”

“----”

“-±-”

Sample Output
6
1 1
1 3
1 4
4 1
4 3
4 4

题意

给定4*4矩阵，每个方格为‘+’或‘-’，对每个方格状态的翻转都会引起所在行、所在列其它方格的翻转，求最小的翻转次数和翻转序列，使得所有方格都为‘-’。

思路

对一个开关进行操作n次，如果n为偶数，那么这个开关以及同行、同列的开关状态都不发生改变，等价于没有操作；如果n为奇数，那么这个开关以及同行同列的开关状态全都发生改变，等价于只操作了一次。和POJ1753的思路基本一致。

代码

public class ThePilotsBrothersRefrigerator {
    int[][] chess = new int[4][4];
    int[] tmpx = new int[20];
    int[] tmpy = new int[20];
    int[] resultx = new int[20];
    int[] resluty = new int[20];
    int count = 33;
    public static boolean check(int[][] chess) {
        for (int i = 0; i < 4; i++) {
            for (int j = 0; j < 4; j++) {
                if (chess[i][j] == 1) {
                    return false;
                }
            }
        }
        return true;
    }
    public void flip(int s) {
        int x = s / 4;
        int y = s % 4;
        for (int i = 0; i < 4; i++) {
            chess[x][i] = (chess[x][i] + 1) % 2;
            chess[i][y] = (chess[i][y] + 1) % 2;
        }
        chess[x][y] = (chess[x][y] + 1) % 2;//x,y的位置反转了2次，在反转一次，反转3次和反转1次的结果一致。
    }

    public void dfs(int s, int b) {//遍历到第 s 个, 翻转了 b个
        if (check(this.chess)) {//已经开锁
            if (this.count > b) {
                this.count = b;
                for (int i = 0; i < b; i++) {
                    resultx[i] = tmpx[i];
                    resluty[i] = tmpy[i];
                }
            }
            return;
        }
        if (s > 15) {
            return;
        }
        dfs(s + 1, b);
        this.flip(s);
        this.tmpx[b] = (int) (s / 4);
        this.tmpy[b] = (int) (s % 4);
        dfs(s + 1, b + 1);
        this.flip(s);
        return;
    }
    public static void main(String[] args) {
        ThePilotsBrothersRefrigerator tpr = new ThePilotsBrothersRefrigerator();
        Scanner sc = new Scanner(System.in);
        for (int i = 0; i < tpr.chess.length; i++) {
            String str = sc.next();
            for (int j = 0; j < tpr.chess[i].length; j++) {
                if (str.charAt(j) == '-') {
                    tpr.chess[i][j] = 0;
                } else {
                    tpr.chess[i][j] = 1;
                }
            }
        }
        tpr.dfs(0, 0);
        System.out.println(tpr.count);
        for (int i = 0; i < tpr.count; i++) {
            System.out.println((tpr.resultx[i]+1)+" "+(tpr.resluty[i]+1));
        }
    }
}