HDU 4771 Stealing Harry Potter's Precious

A 点击打开链接

#include<stdio.h>
#include<string.h>
#include<stack>
#include<string>
#include<math.h>
#include<queue>
#include<set>
#include<algorithm>
#include<iostream>
#include<vector>
#include<map>
using namespace std;
#define LL long long
#define inf 0x3f3f3f3f
#define N 110
struct node
{
   int x,y,z;
}net,cur;
int mark[1<<4][N][N];
char Map[N][N];
int d[4][2]={0,1,0,-1,1,0,-1,0};
node K[5];
int n,m,k;
bool judge(int x,int y,int z)
{
    if(x>n||x<1||y>m||y<1) return 0;
    if(mark[z][x][y]>0||Map[x][y]=='#') return 0;
    return 1;
}
int BFS(int sx ,int sy)
{
   queue<node>q;
   cur.x = sx,cur.y = sy,cur.z = 0;
   memset(mark,0,sizeof(mark));
   q.push(cur);
   mark[cur.z][cur.x][cur.y] = 1;
   while(!q.empty())
   {
      cur = q.front();q.pop();
      if(cur.z == (1<<k) - 1)
      return mark[cur.z][cur.x][cur.y] - 1;
      for(int i=0;i<4;i++)
      {
         net.x=cur.x+d[i][0];
         net.y=cur.y+d[i][1];
         net.z=cur.z;
         int mk=0;
         for(int j=1;j<=k;j++)
            if(net.x==K[j].x&&net.y==K[j].y)
            {
                mk=j;
                break;
            }
         if(mk) net.z=cur.z|(1<<(mk-1));
         if(judge(net.x,net.y,net.z))
         {
            mark[net.z][net.x][net.y]=mark[cur.z][cur.x][cur.y]+1;
            q.push(net);
         }
      }
   }
   return -1;
}
int main ()
{
   int i,j,sx,sy;
   while(scanf("%d%d",&n,&m),n+m)
   {
      for(i=1;i<=n;i++)
      {
         scanf("%s",Map[i]+1);
         for(j=1;j<=m;j++)
         {
            if(Map[i][j]=='@')
            	sx=i,sy=j;
         }
      }
      scanf("%d",&k);
      for(i=1;i<=k;i++)
      scanf("%d%d",&K[i].x,&K[i].y);
      printf("%d\n",BFS(sx,sy));
   }
   return 0;
}