HDU 4771 BFS + 状压

Stealing Harry Potter's Precious

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1343    Accepted Submission(s): 642

Problem Description

　　Harry Potter has some precious. For example, his invisible robe, his wand and his owl. When Hogwarts school is in holiday, Harry Potter has to go back to uncle Vernon's home. But he can't bring his precious with him. As you know, uncle Vernon never allows such magic things in his house. So Harry has to deposit his precious in the Gringotts Wizarding Bank which is owned by some goblins. The bank can be considered as a N × M grid consisting of N × M rooms. Each room has a coordinate. The coordinates of the upper-left room is (1,1) , the down-right room is (N,M) and the room below the upper-left room is (2,1)..... A 3×4 bank grid is shown below:　　Some rooms are indestructible and some rooms are vulnerable. Goblins always care more about their own safety than their customers' properties, so they live in the indestructible rooms and put customers' properties in vulnerable rooms. Harry Potter's precious are also put in some vulnerable rooms. Dudely wants to steal Harry's things this holiday. He gets the most advanced drilling machine from his father, uncle Vernon, and drills into the bank. But he can only pass though the vulnerable rooms. He can't access the indestructible rooms. He starts from a certain vulnerable room, and then moves in four directions: north, east, south and west. Dudely knows where Harry's precious are. He wants to collect all Harry's precious by as less steps as possible. Moving from one room to another adjacent room is called a 'step'. Dudely doesn't want to get out of the bank before he collects all Harry's things. Dudely is stupid.He pay you $1,000,000 to figure out at least how many steps he must take to get all Harry's precious.

 

Input

　　There are several test cases. 　　In each test cases: 　　The first line are two integers N and M, meaning that the bank is a N × M grid(0<N,M <= 100). 　　Then a N×M matrix follows. Each element is a letter standing for a room. '#' means a indestructible room, '.' means a vulnerable room, and the only '@' means the vulnerable room from which Dudely starts to move. 　　The next line is an integer K ( 0 < K <= 4), indicating there are K Harry Potter's precious in the bank. 　　In next K lines, each line describes the position of a Harry Potter's precious by two integers X and Y, meaning that there is a precious in room (X,Y). 　　The input ends with N = 0 and M = 0

 

Output

　　For each test case, print the minimum number of steps Dudely must take. If Dudely can't get all Harry's things, print -1.

 

Sample Input

2 3 ##@ #.# 1 2 2 4 4 #@## .... #### .... 2 2 1 2 4 0 0

 

Sample Output

-1 5

 

Source

2013 Asia Hangzhou Regional Contest

 

Recommend

We have carefully selected several similar problems for you:  5057 5055 5054 5053 5052 

题意和题解转自：http://blog.csdn.net/qq574857122/article/details/14649319

题意：

给定n*m的地图

#为墙 @为起点

下面K个坐标

问：遍历K个给定坐标，需要的最小步数

思路：

因为K 最大只有4

状压 当前是否走过某点

用二进制 的 i 位 0、1表示 第i个点是否走过

 #include<iostream>
 #include<cstring>
 #include<cstdlib>
 #include<cstdio>
 #include<algorithm>
 #include<cmath>
 #include<queue>
 #include<map>
 #include<string>

 #define N 105
 #define M 15
 #define mod 10000007
 //#define p 10000007
 #define mod2 100000000
 #define ll long long
 #define LL long long
 #define maxi(a,b) (a)>(b)? (a) : (b)
 #define mini(a,b) (a)<(b)? (a) : (b)

 using namespace std;

 int ans;
 int n,m;
 int k;
 char s[N][N];
 int a[N][N];
 int mi[][N][N];
 int dirx[]={,,-,};
 int diry[]={,,,-};

 typedef struct
 {
     int x;
     int y;
     int step;
     int st;
 }PP;

 PP start;

 void ini()
 {
     ans=-;
     int i,j,p;
     int x,y;
     for(i=;i<n;i++){
         scanf("%s",s[i]);
     }
     memset(a,,sizeof(a));
     scanf("%d",&k);
     for(i=;i<n;i++){
         for(j=;j<m;j++){
             for(p=;p<(<<k);p++){
                 mi[p][i][j]=;
             }
             if(s[i][j]=='@'){
                 start.x=i;
                 start.y=j;
                 start.st=;
                 start.step=;
             }
             if(s[i][j]=='#'){
                 a[i][j]=-;
             }
         }
     }
     for(i=;i<k;i++){
         scanf("%d%d",&x,&y);
         a[x-][y-]=(<<i);
         if(x-==start.x && y-==start.y){
             start.st+=(<<i);
             mi[start.st][start.x][start.y]=;
         }
     }
     if(start.st==){
         mi[][start.x][start.y]=;
     }

    // for(i=0;i<n;i++){
     //    for(j=0;j<m;j++){
     //        printf(" %d",a[i][j]);
     //    }printf("\n");
    // }
 }

 int ok(int i,int j)
 {
     if(i>= && i<n && j>= && j<m && a[i][j]!=-){
         return ;
     }
     return ;
 }

 void solve()
 {
     int i;
     PP now,nx;
     queue<PP> q;
     q.push(start);
     while(q.size()>=)
     {

         now=q.front();
       //  printf(" i=%d j=%d st=%d step=%d\n",now.x,now.y,now.st,now.step);
         q.pop();
         if(now.st== ((<<k)-) ){
             ans=now.step;return;
         }

         for(i=;i<;i++){
             nx=now;
             nx.step++;
             nx.x=now.x+dirx[i];
             nx.y=now.y+diry[i];
             if(ok(nx.x,nx.y)==) continue;
             if( (now.st & a[nx.x][nx.y])==){
                 nx.st=(now.st ^ a[nx.x][nx.y]);
                // printf("  %d %d %d\n",now.st, a[nx.x][nx.y],nx.st);
                 //q.push(nx);
               //  mi[nx.st][nx.x][nx.y]=min(nx.step,mi[nx.st][nx.x][nx.y]);
             }
             //else{
                 if( nx.step< mi[nx.st][nx.x][nx.y]){
                     q.push(nx);
                     mi[nx.st][nx.x][nx.y]=nx.step;
                 }
            // }
         }
     }
 }

 void out()
 {
     printf("%d\n",ans);
 }

 int main()
 {
     //freopen("data.in","r",stdin);
     //freopen("data.out","w",stdout);
     //scanf("%d",&T);
    // for(int ccnt=1;ccnt<=T;ccnt++)
    // while(T--)
     while(scanf("%d%d",&n,&m)!=EOF)
     {
         if(n== && m== ) break;
         //printf("Case %d: ",ccnt);
         ini();
         solve();
         out();
     }

     return ;
 }