(枚举初级+回溯)poj1753 Flip Game

 

Flip Game
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 47376 Accepted: 20247

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

[Submit]   [Go Back]   [Status]   [Discuss]

题目大意:

有16个棋子,你翻转一个棋子,它不但本身的颜色改变,还会使其上下左右这四个放下紧挨的棋子颜色改变(颜色只有黑白两种)。你在这十六个棋子中随意翻转,看最少翻转几个棋子,使得整盘棋颜色相同。

解题感悟:

借鉴了好多代码,很多人都用了递归,DFS函数那块我不大理解,里面递归回溯,整不明白了哭先撂着吧,,,慢慢来

别人的代码吐舌头

#include<iostream>//POJ1753  
#include<cstdio>  
#include<algorithm>//反转i次后,如果不能颜色一样,那么就再翻转一次,即i+1次  
using namespace std;//反转偶数次和没有进行反转是相同的  
char str;//  
int digit[6][6];  
int flag,step;  
//int go[4][2]={1,0,-1,0,0,1,0,-1};  
int r[]={-1,1,0,0,0};//便于翻棋操作  
int c[]={0,0,-1,1,0};  
//判断是否颜色已经完全一样  
bool Judge(void)  
{  
    for(int i=1;i<5;i++)  
        for(int j=1;j<5;j++)  
            if(digit[i][j]!=digit[1][1])  
                return false;  
    return true;  
}  
//对棋子及其周边的棋子进行反转  
void flip(int row,int col)//翻棋  
{  
    int i;  
    for(i=0;i<5;i++)  
        digit[row+r[i]][col+c[i]]=!digit[row+r[i]][col+c[i]];  
    return;  
}  
  
void dfs(int row,int col,int deep)   
{  
    if(deep==step)  
    {  
        flag=Judge();  
        return;  
    }  
    if(flag||row==5)return;  
  
    flip(row,col);       //翻棋  
    if(col<4)  
        dfs(row,col+1,deep+1);  
    else  
        dfs(row+1,1,deep+1);  
  
    flip(row,col);      //不符合则翻回来  
    if(col<4)  
        dfs(row,col+1,deep);  
    else  
        dfs(row+1,1,deep);  
  
    return;  
}  
  
int main(void)  
{  
    char temp;  
    int i,j;  
    for(i=1;i<5;i++)  
        for(j=1;j<5;j++)  
        {  
            cin>>temp;  
            if(temp=='b')  
                digit[i][j]=true;  
        }  
  
    for(step=0;step<=16;step++)  //对每一步产生的可能性进行枚举  
    {                            //至于为什么是16,考虑到4x4=16格,而每一格只有黑白两种情况,则全部的可能性为2^16  
        dfs(1,1,0);  
        if(flag)  
            break;  
    }  
  
    if(flag)  
        cout<<step<<endl;  
    else  
        cout<<"Impossible"<<endl;  
    return 0;  
} 


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值