POJ2965 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

题意

反正有个门，上面开关是4X4的，每打开一个开关(x0,y0)就把这一排(x0,*)和一列(*,yo)的把手状态全部改变。问开门最少需要多少步，再把步骤全部输出。

思路

和poj1753思路基本完全一致，不再更多赘述，注意判断时只有全是开的状态才行。直接上代码。

提交代码

#include <stdio.h>

bool handles[4][4];
bool anses[4][4] = {0};
bool ta[4][4] = {0};
int ans = 999;

bool panduan(){
  for(int i = 0 ; i < 4 ; i++){
    for(int j = 0 ; j < 4 ; j++){
      if( !handles[i][j] ) return false;
    }
  }
  return true;
}

void flip(int x , int y){
  for(int i = 0 ; i < 4 ; i++){
    handles[x][i] = !handles[x][i];
    handles[i][y] = !handles[i][y];
  }
  //xy位置被反动了两次，需要加一次。
  handles[x][y] = !handles[x][y];
  anses[x][y] = !anses[x][y];
}

void dfs(int x , int y , int t){
  if( panduan()  ){
    if(t < ans) {
      ans = t;
      for(int i = 0 ; i < 4 ; i++){
        for(int j = 0 ; j < 4 ; j++){
          ta[i][j] = anses[i][j];
        }
      }
    }
    return;
  }
  
  if( y > 3 ) return;
  //by wjq

  int nx,ny;
  if( x < 3 ){
    nx = x + 1;
    ny = y;
  }else{
    nx = 0;
    ny = y + 1;
  }

  flip( x , y );
  dfs( nx , ny , t+1 );
  flip( x , y );
  dfs( nx , ny , t );
}

bool isOpen(char c){
  if(c == '-') return true;
  else return false;
}

int main(){
  for( int i = 0 ; i < 4 ; i++ ){
    for( int j = 0 ; j < 4 ; j++ ){
      handles[i][j] = isOpen( getchar() );
    }
    getchar();
  }

  dfs( 0 , 0 , 0 );
  printf("%d\n",ans);
  for(int i = 0 ; i < 4 ; i++){
    for(int j = 0 ; j < 4 ; j++){
      if(ta[i][j]) printf("%d %d\n",i+1,j+1);
    }
  }
}