摘要:BFS, 状态压缩的搜索,位操作。
#include <iostream>
#include <queue>
#include <cassert>
using namespace std;
const int MAX_STATE = 0xffff;
const int MIN_STATE = 0x0000;
int step[MAX_STATE+1] = {0};
int getNextState(int flip, int state)
{
state ^= ( 1 << flip );
if( flip >= 4 ){
state ^= (1 << (flip-4));
}
if( flip%4 != 3 ){
state ^= (1 << (flip+1));
}
if( flip <= 11 ){
state ^= (1 << (flip+4));
}
if( flip%4 != 0 ){
state ^= (1 << (flip-1));
}
return state;
}
int main()
{
char ch;
int cur_state = 0;
for(int i=0; i<16; i++){
cin >> ch;
int temp = (ch=='b'?1:0);
cur_state = (cur_state | (temp << i));
}
if( cur_state == MIN_STATE || cur_state==MAX_STATE){
cout << "0" << endl;
return 0;
}
queue<int> q;
q.push(cur_state);
step[cur_state] = 0;
while( !q.empty() ){
int new_state = q.front();
q.pop();
for(int i=0; i<16; i++){
int next_state = getNextState(i, new_state);
assert(next_state<=MAX_STATE && next_state>=MIN_STATE);
if( next_state == MAX_STATE || next_state == MIN_STATE ){
cout << step[new_state]+1 << endl;
return 0 ;
}
if( step[next_state] != 0 ){
continue;
}
q.push(next_state);
step[next_state] = step[new_state]+1;
}
}
cout << "Impossible" << endl;
return 0;
}