POJ 1753 Flip Game 暴力深搜

阳光穿透心脏的1/2处 2023-07-13 04:17 13阅读 0赞

POJ 1753 Flip Game 暴力 深搜

[题目链接][Link 1]

## Flip Game ##

Time Limit: 1000MS Memory Limit: 65536K  
Total Submissions: 59468 Accepted: 24750

### 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:  
Choose any one of the 16 pieces.  
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 ###

#### Source ####

Northeastern Europe 2000

## AC代码 ##

#include <iostream>
    #include <cstdio>
    
    using namespace std;
    
    char str[6];
    int a[6][6];
    int ans=17;
    
    void flip(int x,int y)
    {
        
        a[x][y]=!a[x][y];
        a[x-1][y]=!a[x-1][y];
        a[x+1][y]=!a[x+1][y];
        a[x][y-1]=!a[x][y-1];
        a[x][y+1]=!a[x][y+1];
    }
    
    bool same_color(void)
    {
        
        for(int i=1;i<=4;++i)
        {
        
            for(int j=1;j<=4;++j)
            {
        
                if(a[i][j]!=a[1][1])
                {
        
                    return false;
                }
            }
        }
        return true;
    }
    
    void dfs(int x,int y,int t)
    {
        
        // 判断是否同色，同色满足，返回
        if(same_color())
        {
        
            if(ans>t)
            {
        
                ans=t;
            }
            return;
        }
        // 深搜截止条件
        if(x>4)
        {
        
            return;
        }
    
        if(y==4)
        {
        
            // 当前不反转
            dfs(x+1,1,t);
            // 当前反转
            flip(x,y);
            dfs(x+1,1,t+1);
            // 状态还原
            flip(x,y);
        }
        else
        {
        
            dfs(x,y+1,t);
            flip(x,y);
            dfs(x,y+1,t+1);
            flip(x,y);
        }
    
    }
    
    int main()
    {
        
        for(int i=1;i<=4;++i)
        {
        
            scanf("%s",str+1);
            for(int j=1;j<=4;++j)
            {
        
                // a->0,b->1
                if(str[j]=='w')
                {
        
                    a[i][j]=0;
                }
                else
                {
        
                    a[i][j]=1;
                }
                //a[i][j]=str[j]-'a';
                //printf("%d ",a[i][j]);
            }
            //printf("\n");
        }
    
    
        dfs(1,1,0);
    
        if(ans==17)
        {
        
            printf("Impossible\n");
        }
        else
        {
        
            printf("%d\n",ans);
        }
    
    
    
        return 0;
    }

[Link 1]: http://poj.org/problem?id=1753