hdu1067-Gap(bfs+哈希)

Let's play a card game called Gap. You have 28 cards labeled with two-digit numbers. The first digit (from 1 to 4) represents the suit of the card, and the second digit (from 1 to 7) represents the value of the card.
First, you shu2e the cards and lay them face up on the table in four rows of seven cards, leaving a space of one card at the extreme left of each row. The following shows an example of initial layout.

Next, you remove all cards of value 1, and put them in the open space at the left end of the rows: "11" to the top row, "21" to the next, and so on.
Now you have 28 cards and four spaces, called gaps, in four rows and eight columns. You start moving cards from this layout.

At each move, you choose one of the four gaps and fill it with the successor of the left neighbor of the gap. The successor of a card is the next card in the same suit, when it exists. For instance the successor of "42" is "43", and "27" has no successor.
In the above layout, you can move "43" to the gap at the right of "42", or "36" to the gap at the right of "35". If you move "43", a new gap is generated to the right of "16". You cannot move any card to the right of a card of value 7, nor to the right of a gap.
The goal of the game is, by choosing clever moves, to make four ascending sequences of the same suit, as follows.

Your task is to find the minimum number of moves to reach the goal layout.

 

Input

The input starts with a line containing the number of initial layouts that follow.
Each layout consists of five lines - a blank line and four lines which represent initial layouts of four rows. Each row has seven two-digit numbers which correspond to the cards.

 

Output

For each initial layout, produce a line with the minimum number of moves to reach the goal layout. Note that this number should not include the initial four moves of the cards of value 1. If there is no move sequence from the initial layout to the goal layout, produce "-1".

 

Sample Input

4

12 13 14 15 16 17 21

22 23 24 25 26 27 31

32 33 34 35 36 37 41

42 43 44 45 46 47 11

 

26 31 13 44 21 24 42

17 45 23 25 41 36 11

46 34 14 12 37 32 47

16 43 27 35 22 33 15

 

17 12 16 13 15 14 11

27 22 26 23 25 24 21

37 32 36 33 35 34 31

47 42 46 43 45 44 41

 

27 14 22 35 32 46 33

13 17 36 24 44 21 15

43 16 45 47 23 11 26

25 37 41 34 42 12 31

 

Sample Output

33

60

-1

 

题意：给出表如第一个图，给出每个数，共有28个数，首先要将11,21,31,41放到前面去如第二个图，然后每次可以挑选一个空位把某个数放在此位置，但是

要保证此数恰好是空位左边的数的后一个数，比如空位左边的数是42，则只能把43移到空位去。如果是47的话是没有后一个数的。

 

解析：总共有32个数，用哈希保存状态。然后bfs即可。详见代码实现。

 

代码

#include<cstdio>
#include<cstring>
#include<string>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<utility>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#include<iterator>
#include<stack>
using namespace std;
const int INF=1e9+;
const int eps=0.0000001;
typedef __int64 LL;
const LL mod=;
int maze[][];
LL Hash[mod];
LL base[];
struct node
{
    int px[],py[]; //保存四个空位
    int S[][];     //整个图
    int dist;
}Nod[];
int id;
queue<int> que;

int goal[][]={    //最终状态
{ ,,,,,,, },
{ ,,,,,,, },
{ ,,,,,,, },
{ ,,,,,,, }
};
LL G;
void GetBase()  //打出2^i
{
    base[]=;
    for(int i=;i<;i++) base[i]=base[i-]*;
}
int GetId(int x,int y){ return x*+y; }
void SetHead()
{
    for(int i=;i<;i++)
        for(int j=;j<;j++)
    {
        int a=maze[i][j]/;
        int b=maze[i][j]%;
        if(b==) { maze[a-][]=maze[i][j]; maze[i][j]=; } //把11,21,31,41挑出来
    }
}
LL GetHash(int S[][])
{
    LL ret=;
    for(int i=;i<;i++)
        for(int j=;j<;j++) ret+=(LL)S[i][j]*base[GetId(i,j)];  //得到哈希值
    return ret;
}
bool InsertHash(LL val)
{
   LL v=val%mod;
   while(Hash[v]!=-&&Hash[v]!=val)  v=(v+)%mod;   //判重
   if(Hash[v]==-){ Hash[v]=val; return true; }  //可以插入
   return false;
}
void init()
{
    memset(Hash,-,sizeof(Hash));
    while(!que.empty())  que.pop();
    id=;
    G=GetHash(goal);
    int k=;
    int cur=id++;
    for(int i=;i<;i++)
        for(int j=;j<;j++)
    {
        Nod[cur].S[i][j]=maze[i][j];
        if(maze[i][j]==){ Nod[cur].px[k]=i; Nod[cur].py[k++]=j; }  //得到最初的状态
    }
    Nod[cur].dist=;
    que.push(cur);
}
void Change_S(node& e,int x,int y,int pick,int k)
{
    for(int i=;i<;i++)
        for(int j=;j<;j++)
        if(e.S[i][j]==pick)
    {
        e.S[i][j]=;
        e.S[x][y]=pick;
        e.px[k]=i; e.py[k]=j;
        return;
    }
}
void AddNode(int now)
{
    node& e=Nod[now];
    for(int i=;i<;i++)
    {
        int x=e.px[i];
        int y=e.py[i];
        int pre=e.S[x][y-];
        if(pre==) continue;  //也是空位不管

        int a=pre/;
        int b=pre%;
        if(b==) continue;  //不能是*7

        int pick=pre+;
        node t=e;
        t.dist++;
        Change_S(t,x,y,pick,i);
        LL nowG=GetHash(t.S);
        if(!InsertHash(nowG)) continue;  //能否插入

        int cur=id++;
        Nod[cur]=t;
        que.push(cur);
    }
}
int solve()
{
    SetHead();
    init();
    while(!que.empty())
    {
        int now=que.front();  que.pop();
        node& e=Nod[now];
        LL nowG=GetHash(e.S);
        if(nowG==G) return e.dist;  //找到解
        AddNode(now);
    }
    return -;
}
int main()
{
    int T;
    GetBase();
    cin>>T;
    while(T--)
    {
        memset(maze,,sizeof(maze));
        for(int i=;i<;i++)
            for(int j=;j<;j++) cin>>maze[i][j];
        printf("%d\n",solve());
    }
    return ;
}