zoukankan      html  css  js  c++  java
  • Flip Game poj 1753

    Flip Game
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 29731   Accepted: 12886

    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


     1 #include <iostream>
     2 #include <string.h>
     3 #include <stdio.h>
     4 #include <map>
     5 #include <vector>
     6 #include <queue>
     7 using namespace std;
     8 int ans=20;
     9 int an[16]= {0x13,0x27,0x4e,0x8c,
    10              0x131,0x272,0x4e4,0x8c8,
    11              0x1310,0x2720,0x4e40,0x8c80,
    12              0x3100,0x7200,0xe400,0xc800
    13             };
    14 bool check(int n)
    15 {
    16     if(n==0)return 1;
    17     n^=0xffff;
    18     if(n==0)return 1;
    19     return 0;
    20 }
    21 void fun(int x,int n,int aa)
    22 {
    23     if(check(n))ans=min(ans,aa);
    24     if(x==16)return;
    25     fun(x+1,n^an[x],aa+1);
    26     fun(x+1,n,aa);
    27 }
    28 int main()
    29 {
    30     char a;
    31     int i,j,n=0;
    32     for(i=0; i<4; i++)
    33     {
    34         for(j=0; j<4; j++)
    35         {
    36             a=getchar();
    37             if(a=='b')
    38                 n=(n<<1)+1;
    39             else n<<=1;
    40         }
    41         getchar();
    42     }
    43     fun(0,n,0);
    44     if(ans!=20)
    45     cout<<ans<<endl;
    46     else cout<<"Impossible"<<endl;
    47 }
    View Code
  • 相关阅读:
    20、虚拟内存的目的是什么?
    19、进程间通信有哪几种方式?把你知道的都说出来
    18、进程通信方法(Linux和windows下),线程通信方法(Linux和 windows下)
    17、操作系统在对内存进行管理的时候需要做些什么?
    16、进程同步的四种方法?
    python学习——生成器表达式
    python学习——闭包
    细说websocket
    git hg提交拉取
    切换samba用户
  • 原文地址:https://www.cnblogs.com/ERKE/p/3829300.html
Copyright © 2011-2022 走看看