zoukankan      html  css  js  c++  java
  • POJ1753——DFS+枚举——Flip Game

    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

    大意:翻转一个棋子,周围的棋子也要改变,求最小翻的次数
    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    using namespace std;
    int a[6][6];
    int step,flag;
    int judge(int a[6][6]){
        for(int i = 1; i <= 4; i++){
                for(int j = 1; j <= 4; j ++){
                        if(a[i][j] != a[1][1])
                         return 0;
                }
        }
        return 1;
    }
    void fanzhuan(int i,int j){
        a[i][j] = !a[i][j];
        a[i][j+1] = !a[i][j+1];
        a[i][j-1] = !a[i][j-1];
        a[i+1][j] = !a[i+1][j];
        a[i-1][j] = !a[i-1][j];
    }
    void dfs(int i, int j,int foot){
        if(foot == step)
        {
            flag = judge(a);
            if(flag == 1) return ;
        }
        if(flag||i == 5) return ;
        fanzhuan(i,j);
        if(j<4)
        dfs(i,j+1,foot+1);
        else dfs(i+1,1,foot+1);
        fanzhuan(i,j);
        if(j<4)
        dfs(i,j+1,foot);
        else dfs(i+1,1,foot);
        return ;
    }
    int main(){
        char t;
        int i,j;
        memset(a,0,sizeof(a));
        for( i = 1; i <= 4 ; i++){
            for( j = 1; j <= 4; j++){
                  scanf("%c",&t);
                  if(t == 'b') a[i][j] = 1;
            }
            getchar();
        }
        for(step = 0; step<= 16; step++){
            dfs(1,1,0);
            if(flag==1)
                break;
        }
        if(step>16)
            printf("Impossible
    ");
        else printf("%d
    ",step);
        return 0;
    }
    View Code
  • 相关阅读:
    CodeForces 52B Right Triangles 矩阵上的计数
    电影节
    怎样高速生成随机数
    VS2010版快捷键
    两个下拉框选择后取出这两个框的区间值
    vs操作快捷键
    输入框限制,条件是左边输入框输入的数字要小于右边输入框的值,两边输入框要为整型数字。
    DateTime.Parse
    清空文本输入框的值
    sql 随机函数newid()
  • 原文地址:https://www.cnblogs.com/zero-begin/p/4313118.html
Copyright © 2011-2022 走看看