POJ 2965 The Pilots Brothers' refrigerator 解题报告

http://poj.org/problem?id=2965

这题和1753那题差不多，都是可以用位操作，也可以用高斯消元的方式做，我用的是BFS加位操作过的，不过提交的时候，用C++是TLE，用G++是641MS.具体的解决思路跟1753差不多，不多讲了，看看代码应该就明白了。

下面代码贴上

#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
#include <cstring>
using namespace std;
const int wei[16]={0xF888,0XF444,0XF222,0XF111,0X8F88,0X4F44,0X2F22,0X1F11,0X88F8,0X44F4,0X22F2,0X11F1,0X888F,0X444F,0X222F,0X111F};
struct S
{
	int m;
	int c;
	int pos;
	int father;
};
int main(){
	int i,j;
	char str[5];
	int visited[1<<16];
	int matrix;
	while(scanf("%s",str)!=EOF){
		memset(visited,0,sizeof(visited));
		queue<S> qqq;
		vector<S> vvv;
		matrix=0;
		for(j=0;j<4;j++){
			if(str[j]=='-')
				matrix|=1<<(3*4+(3-j));
		}
		for(i=2;i>=0;i--){
			scanf("%s",str);
			for(j=0;j<4;j++){
				if(str[j]=='-'){
					matrix|=1<<(i*4+(3-j));
				}
			}
		}
		S temp;
		temp.m=matrix;
		temp.c=0;
		temp.father=-1;
		temp.pos=-1;
		qqq.push(temp);
		bool flag=false;
		int ans=-1;
		while(!qqq.empty()){
			S sss=qqq.front();
			qqq.pop();
			vvv.push_back(sss);
			if(sss.m==0xffff){
				ans=sss.c;
				break;
			}
			sss.c++;
			for(i=0;i<16;i++){
				S temp2=sss;
				temp2.m^=wei[i];
				if(visited[temp2.m]){
					continue;
				}
				temp2.pos=i;
				temp2.father=vvv.size()-1;
				visited[temp2.m]=1;
				qqq.push(temp2);
			}
		}
		vector<int> v2;
		if(ans!=-1){
			i=vvv.size()-1;
			while(vvv[i].pos!=-1){
				v2.push_back(vvv[i].pos);
				i=vvv[i].father;
			}
			printf("%d\n",ans);
			for(i=v2.size()-1;i>=0;i--){
				printf("%d %d\n",v2[i]/4+1,v2[i]%4+1);
			}
		}
	}
	return 0;
}