poj 1753Flip Game（dfs）

题目链接：http://poj.org/problem?id=1753

题意：一个4*4的矩阵，每一格要么是白色，要么是黑色。现在你可以选择任意一个格变成相反的颜色，则这个格的上，下，左，右四个格也会跟着变成相反的色（如果存在的话）。问要把矩阵的所有格子变成同一个颜色，你最少需执行几次上面的操作。

 

思路：枚举+dfs。一个关键点：对于每一格，只能翻0或1次（易证）。因此枚举就存在2^16 = 4096个状态，最多执行16次操作，因此可行。

Flip Game

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 40820		Accepted: 17729

Description

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. 

Input

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

bwwb
bbwb
bwwb
bwww

Sample Output

4

Source

Northeastern Europe 2000

#include<iostream>
using namespace std;

bool map[6][6], flag = false;
int step;
int dr[5] = {-1, 0, 0, 0, 1};
int dc[5] = {0, -1, 0, 1, 0};

bool isgoal(){                           //  判断矩阵的所有格子是否为同一个颜色。
    for(int i = 1; i <= 4; i ++)
        for(int j = 1; j <= 4; j ++)
            if(map[i][j] != map[1][1])
                return false;
    return true;
}

void flip(int row, int col){             //  翻动点(row,col)时的map[][]的变化。
    for(int i = 0; i < 5; i ++){
        int r = row + dr[i];
        int c = col + dc[i];
        map[r][c] = !map[r][c];
    }
}

void dfs(int row, int col, int dep){     //  点(row,col)为现在是否要操作的点。
    if(dep == step){
        flag = isgoal();
        return;
    }
    if(flag || row == 5) return;

    flip(row, col);                      //  要对点(row,col)进行翻动。
    if(col < 4) dfs(row, col + 1, dep + 1);
    else dfs(row + 1, 1, dep + 1);

    flip(row, col);                      //  还原状态，不对点(row,col)进行翻动，不翻动dep不+1；
    if(col < 4) dfs(row, col + 1, dep);
    else dfs(row + 1, 1, dep);
}

int main(){
    char c;
    for(int i = 1; i <= 4; i ++)
        for(int j = 1; j <= 4; j ++){
            cin >> c;
            if(c == 'b') map[i][j] = true;;
       }
    for(step = 0; step <= 16; step ++){   //  枚举0 ~ 16 步。
        dfs(1, 1, 0);
        if(flag) break;
    }
    if(flag) cout << step << endl;
    else cout << "Impossible" << endl;
    return