poj_1753

#include <iostream>
#include <queue>
#define MAXSIZE 16
#define MAXSTATE 65536
#define ALLWHITE 65535
#define ALLBLACK 0
using namespace std;

int state[MAXSTATE];
queue<int> Q;
int flip(int CurState, int pos)
{
 CurState = CurState ^ (1<<pos);
 if (pos >= 4) CurState = CurState ^ (1<<(pos-4));
 if (pos < 12) CurState = CurState ^ (1<<(pos+4));
 if (pos % 4 != 0) CurState = CurState ^ (1<<(pos-1));
 if ((pos+1) % 4 != 0) CurState = CurState ^(1<<(pos+1));
 return CurState;
}

void bfs_flip(int CurState)
{
 memset(state,-1,MAXSTATE*sizeof(int));
 state[CurState] = 0;
 Q.push(CurState);
 int NewState = 0;

 while (!Q.empty())
 {
  CurState = Q.front();
  Q.pop();

  for (int i=0; i<MAXSIZE; ++i)
  {
   NewState = flip(CurState, i);
   if (state[NewState] == -1)
   {
    if (NewState == ALLWHITE || NewState == ALLBLACK)
    {
     cout << state[CurState] + 1 << endl;
     return;
    }
    state[NewState] = state[CurState] + 1;
    Q.push(NewState);
   }
   
  }
 }
 cout << "Impossible" << endl;
 return ;
}

int stateOfInput()
{
 int CurState = 0;
 int i = 0;
 char c;
 while (cin >> c)
 {
  if (c == 'b')
  {
   CurState = CurState ^ (1 << i);
  }
  ++i;
 }
 return CurState;
}

int main()
{
 int CurState = stateOfInput();
 if (CurState == ALLWHITE || CurState == ALLBLACK)
 {
  cout << "0" << endl;
 }
 else
 {
  bfs_flip(CurState); 
 }
 return 0;
}

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

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值