poj 1753练习

Flip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other one is black and each piece is lying either it's black or white side up. Each round you flip 3 to 5 pieces, thus changing the color of their upper side from black to white and vice versa. The pieces to be flipped are chosen every round according to the following rules: 

1. Choose any one of the 16 pieces. 
   
2. Flip the chosen piece and also all adjacent pieces to the left, to the right, to the top, and to the bottom of the chosen piece (if there are any).

Consider the following position as an example: 

bwbw 
wwww 
bbwb 
bwwb 
Here "b" denotes pieces lying their black side up and "w" denotes pieces lying their white side up. If we choose to flip the 1st piece from the 3rd row (this choice is shown at the picture), then the field will become: 

bwbw 
bwww 
wwwb 
wwwb 

The goal of the game is to flip either all pieces white side up or all pieces black side up. You are to write a program that will search for the minimum number of rounds needed to achieve this goal. 

nput

The input consists of 4 lines with 4 characters "w" or "b" each that denote game field position.

Output

Write to the output file a single integer number - the minimum number of rounds needed to achieve the goal of the game from the given position. If the goal is initially achieved, then write 0. If it's impossible to achieve the goal, then write the word "Impossible" (without quotes).

Sample Input

bwwbbbwbbwwbbwww

Sample Output

4

题解：

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
bool arr[4][4];  //w 用 1表示   b用 0 表示即false 
const int inf = 10000;
int ans = 10000;
void flip(int x,int y){ //翻转棋子 

arr[x][y]=!arr[x][y];

if(x-1>=0)  
arr[x-1][y]=!arr[x-1][y];
if(x+1<4)  
arr[x+1][y]=!arr[x+1][y];
if(y-1>=0)
arr[x][y-1]=!arr[x][y-1];
if(y+1<4)
arr[x][y+1]=!arr[x][y+1];
} 


bool judge() //判断是否达到 全b  或 全w 
{
int i,j;
for(i=0;i<4;i++)
for(j=0;j<4;j++)
if(arr[i][j] != arr[0][0])
return false;
return true;
}


int dfs(int x,int y,int deep){  //dfs深度搜索 
if(judge()){
if(deep < ans)
ans = deep;   //ans 保存最小翻转次 
return 0;
}


if(x<0 || x>3 || y<0 || y>3)
return 0;
int nx,ny;

nx=(x+1)%4; //相当于按列遍历
ny=y+(x+1)/4;

/*

    ny = (y+1)%4;  //相当于按行遍历 亦可
    nx = x + (y+1)/4;

*/

/*这种写法亦可

上面不需要 利用nx,ny

flip(x,y);
if(y<3)
dfs(x,y+1,deep+1);
else
dfs(x+1,0,deep+1);


fan(x,y);
if(y<3)
dfs(x,y+1,deep);
else
dfs(x+1,0,deep);

*/
flip(x,y);
dfs(nx,ny,deep+1);
flip(x,y);
dfs(nx,ny,deep);

return 0;
}


int main(){
char str[10];
int i,j;
memset(arr,true,sizeof(arr));
for(i=0;i<4;i++)
{
cin >> str;
for(j=0;j<4;j++)
if(str[j] == 'b')
arr[i][j] = false;
}

dfs(0,0,0);

if(ans < inf)
cout << ans << endl;
else
cout << "Impossible" << endl;

return 0;
}