HDU 4634 - BFS + 状态压缩

很好的一道搜索题

做了这题，仔细研究了一下位运算，稍微搞懂了点状态压缩这个东西，很好很强大

//AcerGY
//#pragma comment (linker, "/STACK:1024000000,1024000000")
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#include <vector>
#include <cmath>
#define ll long long
#define BUG puts("BUG!")
#define ci(val) scanf("%d",&val)
#define pi(val) printf("%d\n",val)
#define clr(a,val) memset(a,val,sizeof(a))
#define lowbit(x) ((x)&(-x))
#define inf 0x3f3f3f3f
#define inf64 1LL<<60
#define PI acos(-1.0)
#define eps 1e-8

//Game Theory
#define P "First"
#define N "Second"

#define maxn 220
#define mod 10009

using namespace std;

void readfile(char s[])
{
#ifndef ONLINE_JUDGE
	freopen(s,"r",stdin);
#endif
}

char g[maxn][maxn];
int key[maxn][maxn],knum;
bool used[maxn][maxn][1<<7];
bool vis[maxn][maxn][1<<7][4];
int dir[4][2] = {0,1,0,-1,1,0,-1,0};
int sx,sy,ex,ey;
int n,m;

struct node
{
	int x,y;
	int step,key;
};

int BFS()
{
	queue<node> q;
	memset(used,false,sizeof(used));
	memset(vis,false,sizeof(vis));
	node u , v;
	u.x = sx;u.y=sy;
	u.key = 0;u.step=0;
	q.push(u);
	used[sx][sy][0] = true;
	while(!q.empty())
	{
		u = q.front(); q.pop();
		for(int i=0;i<4;i++)
		{
			//move direction
			int mx = dir[i][0] , my =dir[i][1];
			int x = u.x , y = u.y , k = u.key;
			while(1)
			{
				if(g[x][y]=='L')
					mx = 0 , my = -1;
				if(g[x][y]=='R')
					mx =0 , my = 1;
				if(g[x][y]=='U')
					mx = -1 , my = 0;
				if(g[x][y]=='D')
					mx =1 , my = 0;

				//set direction
				int d;
				if(mx==-1 && my==0)
					d=0;
				else if(mx==1 && my==0)
					d=1;
				else if(mx==0 && my==1)
					d=2;
				else if(mx==0 && my==-1)
					d=3;

				//set visit status
				if(vis[x][y][k][d])
					break;
				vis[x][y][k][d] = true;

				//error
				x += mx , y += my;
				if(x<0 || y<0 ||	x>=n || y>=m)
					break;
				if(g[x][y]=='#')
					break;

				//reach the door && have enough keys
				if(x==ex && y==ey && k==((1<<knum)-1) )
					return u.step+1;

				if(g[x][y]=='L')
					mx = 0 , my = -1;
				if(g[x][y]=='R')
					mx = 0 , my = 1;
				if(g[x][y]=='U')
					mx = -1 , my = 0;
				if(g[x][y]=='D')
					mx =1 , my = 0;

				//将k的第knum位 置1( key[x][y]= 1<<knum),表示此处钥匙已拿到
				if(g[x][y]=='K')
					k |= key[x][y];

				//in board && reach the wall
				if(x+mx>=0 && x+mx<n && y+my>=0 && y+my<m && g[x+mx][y+my]=='#')
				{
					if(used[x][y][k])
						break;
					v.x = x , v.y = y , v.key = k;
					v.step = u.step + 1;
					q.push(v);
					used[x][y][k] = true;
					break;
				}
			}
		}
	}
	return -1;
}

int main()
{

	readfile("1003.txt");
	int cas = 1;
	while(~scanf("%d%d",&n,&m))
	{
		//printf("Case %d:\n",cas++);
		knum = 0;
		for(int i=0;i<n;i++)
		{
			scanf("%s",g[i]);
			for(int j=0;j<m;j++)
			{
				if(g[i][j]=='S')
					sx = i , sy = j;
				if(g[i][j]=='E')
					ex = i , ey = j;
				if(g[i][j]=='K')
				{
					key[i][j] = (1<<knum);
					knum++;
				}
			}
		}
		int ans = BFS();
		printf("%d\n",ans);
	}
	return 0;
}