[Luogu1379]八数码难题

题目描述

在3×3的棋盘上，摆有八个棋子，每个棋子上标有1至8的某一数字。棋盘中留有一个空格，空格用0来表示。空格周围的棋子可以移到空格中。要求解的问题是：给出一种初始布局（初始状态）和目标布局（为了使题目简单,设目标状态为123804765），找到一种最少步骤的移动方法，实现从初始布局到目标布局的转变。

输入输出格式

输入格式：

输入初始状态，一行九个数字，空格用0表示

输出格式：

只有一行，该行只有一个数字，表示从初始状态到目标状态需要的最少移动次数(测试数据中无特殊无法到达目标状态数据)

输入输出样例

输入样例#1：

283104765

输出样例#1：

4

---

普通搜索7000ms

#include <cstdio>
#include <iostream>
#include <queue>
#include <map>
using namespace std;
#define reg register
#define ll long long
ll St, Ed;
map<ll, int> vis;
struct date {
    ll hsh;
    int stp;
};
const int dx[] = {, , -, , }, dy[] = {, , , , -};
int main()
{
    scanf("%lld", &St);
    Ed = ;
    queue <date> q;
    q.push((date){St, });
    while(!q.empty())
    {
        ll hsh = q.front().hsh;
        int tp = q.front().stp;
        q.pop();
        if (hsh == Ed) {
            printf("%d\n", tp);
            return ;
        }
        int a[][];
        int tmp = hsh;
        for (reg int i =  ; i >=  ; i --)
            for (reg int j =  ; j >=  ; j --)
                a[i][j] = tmp % , tmp /= ;
        int x = , y = ;
        for (reg int i =  ; i <=  ; i ++)
            for (reg int j =  ; j <=  ; j ++)
                if (!a[i][j]) {x = i, y = j;break;}
        for (reg int i =  ; i <=  ; i ++)
        {
            int tx = x + dx[i], ty = y + dy[i];
            if (tx <=  or tx >  or ty <=  or ty > ) continue;
            swap(a[x][y], a[tx][ty]);
            int nhsh = ;
            for (reg int i =  ; i <=  ; i ++)
                for (reg int j =  ; j <=  ; j ++)
                    nhsh = nhsh *  + a[i][j];
            if (!vis[nhsh]) vis[nhsh] = , q.push((date){nhsh, tp + });
            swap(a[x][y], a[tx][ty]);
        }
    }
    return ;
}

双向广搜242ms

#include <cstdio>
#include <iostream>
#include <queue>
#include <map>
using namespace std;
#define reg register
#define ll long long
ll St, Ed;
map<ll, int> vis1, vis2;
struct date {
    ll hsh;
    int stp;
};
const int dx[] = {, , -, , }, dy[] = {, , , , -};
int main()
{
    scanf("%lld", &St);
    Ed = ;
    queue <date> q1, q2;
    q1.push((date){St, });
    q2.push((date){Ed, });
    vis1[St] = , vis2[Ed] = ;
    if (St == Ed) return puts(""), ;
    while(!q1.empty() and !q2.empty())
    {
        ll hsh = q1.front().hsh;
        int tp = q1.front().stp;
        q1.pop();
        if (vis2[hsh]) {
            printf("%d\n", tp + vis2[hsh]);
            return ;
        }
        int a[][];
        int tmp = hsh;
        for (reg int i =  ; i >=  ; i --)
            for (reg int j =  ; j >=  ; j --)
                a[i][j] = tmp % , tmp /= ;
        int x = , y = ;
        for (reg int i =  ; i <=  ; i ++)
            for (reg int j =  ; j <=  ; j ++)
                if (!a[i][j]) {x = i, y = j;break;}
        for (reg int i =  ; i <=  ; i ++)
        {
            int tx = x + dx[i], ty = y + dy[i];
            if (tx <=  or tx >  or ty <=  or ty > ) continue;
            swap(a[x][y], a[tx][ty]);
            int nhsh = ;
            for (reg int i =  ; i <=  ; i ++)
                for (reg int j =  ; j <=  ; j ++)
                    nhsh = nhsh *  + a[i][j];
            if (!vis1[nhsh]) vis1[nhsh] = tp + , q1.push((date){nhsh, tp + });
            swap(a[x][y], a[tx][ty]);
        }
        hsh = q2.front().hsh;
        tp = q2.front().stp;
        q2.pop();
        if (vis1[hsh]) {
            printf("%d\n", tp + vis1[hsh]);
            return ;
        }
        tmp = hsh;
        for (reg int i =  ; i >=  ; i --)
            for (reg int j =  ; j >=  ; j --)
                a[i][j] = tmp % , tmp /= ;
        x = , y = ;
        for (reg int i =  ; i <=  ; i ++)
            for (reg int j =  ; j <=  ; j ++)
                if (!a[i][j]) {x = i, y = j;break;}
        for (reg int i =  ; i <=  ; i ++)
        {
            int tx = x + dx[i], ty = y + dy[i];
            if (tx <=  or tx >  or ty <=  or ty > ) continue;
            swap(a[x][y], a[tx][ty]);
            int nhsh = ;
            for (reg int i =  ; i <=  ; i ++)
                for (reg int j =  ; j <=  ; j ++)
                    nhsh = nhsh *  + a[i][j];
            if (!vis2[nhsh]) vis2[nhsh] = tp + , q2.push((date){nhsh, tp + });
            swap(a[x][y], a[tx][ty]);
        }
    }
    return ;
}