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:
![]() 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]
ACcode:
#pragma warning(disable:4786)//使命名长度不受限制
#pragma comment(linker, "/STACK:102400000,102400000")//手工开栈
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <stack>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#define rd(x) scanf("%d",&x)
#define rd2(x,y) scanf("%d%d",&x,&y)
#define rds(x) scanf("%s",x)
#define rdc(x) scanf("%c",&x)
#define ll long long int
#define maxn 100005
#define mod 1000000007
#define INF 0x3f3f3f3f //int 最大值
#define MT(x,i) memset(x,i,sizeof(x))
#define PI acos(-1.0)
#define E exp(1)
#define FOR(i,f_start,f_end) for(int i=f_start;i<=f_end;++i)
using namespace std;
int ANS[100];
bool mm[6][6];
int cnt,ct;
bool flag(){
bool t=mm[1][1];
FOR(i,1,4)
FOR(j,1,4)
if(mm[i][j]!=t)
return false;
return true;
}
void change(int x,int y){
mm[x][y]=!mm[x][y];
}
void fun(int x,int y){
change(x,y);
if(x>1)change(x-1,y);
if(x<4)change(x+1,y);
if(y>1)change(x,y-1);
if(y<4)change(x,y+1);
}
void dfs(int x,int y){
if(flag()){ANS[ct++]=cnt;return;}
if(x>4)return;
fun(x,y);
cnt++;
if(y<4)dfs(x,y+1);
else dfs(x+1,1);
fun(x,y);
cnt--;
if(y<4)dfs(x,y+1);
else dfs(x+1,1);
}
int main(){
char c;
FOR(i,1,4)
FOR(j,1,4){
cin>>c;
mm[i][j]=(c=='b'?true:false);
}
cnt=0;
ct=0;
dfs(1,1);
sort(ANS,ANS+ct);
if(ct)cout<<ANS[0];
else cout<<"Impossible";
return 0;
}
/*
bwwb
bbwb
bwwb
bwww
*/