Eight

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10778    Accepted Submission(s):
2873
Special Judge

Problem Description
The 15-puzzle has been around for over 100 years; even
if you don't know it by that name, you've seen it. It is constructed with 15
sliding tiles, each with a number from 1 to 15 on it, and all packed into a 4 by
4 frame with one tile missing. Let's call the missing tile 'x'; the object of
the puzzle is to arrange the tiles so that they are ordered as:

 1  2  3  4
5 6 7 8
9 10 11 12
13 14 15 x

where
the only legal operation is to exchange 'x' with one of the tiles with which it
shares an edge. As an example, the following sequence of moves solves a slightly
scrambled puzzle:

 1  2  3  4     1  2  3  4     1  2  3  4     1  2  3  4
5 6 7 8 5 6 7 8 5 6 7 8 5 6 7 8
9 x 10 12 9 10 x 12 9 10 11 12 9 10 11 12
13 14 11 15 13 14 11 15 13 14 x 15 13 14 15 x
r-> d-> r->

The
letters in the previous row indicate which neighbor of the 'x' tile is swapped
with the 'x' tile at each step; legal values are 'r','l','u' and 'd', for right,
left, up, and down, respectively.

Not all puzzles can be solved; in
1870, a man named Sam Loyd was famous for distributing an unsolvable version of
the puzzle, and
frustrating many people. In fact, all you have to do to make
a regular puzzle into an unsolvable one is to swap two tiles (not counting the
missing 'x' tile, of course).

In this problem, you will write a program
for solving the less well-known 8-puzzle, composed of tiles on a three by three

arrangement.

 
Input
You will receive, several descriptions of configuration
of the 8 puzzle. One description is just a list of the tiles in their initial
positions, with the rows listed from top to bottom, and the tiles listed from
left to right within a row, where the tiles are represented by numbers 1 to 8,
plus 'x'. For example, this puzzle

1 2 3
x 4 6
7 5 8

is
described by this list:

1 2 3 x 4 6 7 5 8

 
Output
You will print to standard output either the word
``unsolvable'', if the puzzle has no solution, or a string consisting entirely
of the letters 'r', 'l', 'u' and 'd' that describes a series of moves that
produce a solution. The string should include no spaces and start at the
beginning of the line. Do not print a blank line between cases.
 
Sample Input
2 3 4 1 5 x 7 6 8
 
Sample Output
ullddrurdllurdruldr
 
Source
 
Recommend
JGShining   |   We have carefully selected several
similar problems for you:  1044 1401 1104 1254 1732
 
 康托展开优化,代码自己写的过了,做EIGHTII的时候,发现别人bfs()很简单,而且map[4][2]写的看不懂。
 
 #include<iostream>
#include<stdio.h>
#include<cstring>
#include<cstdlib>
#include<string>
#include<queue>
using namespace std; struct node
{
bool flag;
char str;
int father;
}hash[];
struct st
{
char t[];
};
queue<st>Q;
int ans[]={}; int ktzk(char *c)
{
int i,j,k,sum=;
for(i=;i<=;i++)
{
k=;
for(j=i+;j<=;j++)
if(c[i]>c[j])
k++;
sum=sum+k*ans[-i];
}
return sum;
}
void bfs()
{
int i,k,num,val;
struct st cur,t;
k=ktzk("");
hash[k].flag=true;
hash[k].str='\0';
hash[k].father=k; strcpy(t.t,"");
Q.push(t); while(!Q.empty())
{
cur=Q.front();
Q.pop();
val=ktzk(cur.t);
for(i=;i<=;i++)
{
if(cur.t[i]=='')
{
k=i;
break;
}
}
if(k!= && k!= && k!=)//rigth
{
t=cur;
swap(t.t[k],t.t[k+]);
num=ktzk(t.t);
if(hash[num].flag==false)
{
hash[num].flag=true;
hash[num].str='r';
hash[num].father=val;
Q.push(t);
}
}
if(k!= && k!= && k!=)//left
{
t=cur;
swap(t.t[k],t.t[k-]);
num=ktzk(t.t);
if(hash[num].flag==false)
{
hash[num].flag=true;
hash[num].str='l';
hash[num].father=val;
Q.push(t);
}
}
if(k>=)//u
{
t=cur;
swap(t.t[k],t.t[k-]);
num=ktzk(t.t);
if(hash[num].flag==false)
{
hash[num].flag=true;
hash[num].str='u';
hash[num].father=val;
Q.push(t);
}
}
if(k<=)//D
{
t=cur;
swap(t.t[k],t.t[k+]);
num=ktzk(t.t);
if(hash[num].flag==false)
{
hash[num].flag=true;
hash[num].str='d';
hash[num].father=val;
Q.push(t);
}
}
}
}
void prepare()
{
int i;
for(i=;i<=;i++)
{
hash[i].flag=false;
}
for(i=;i<=;i++) ans[i]=ans[i-]*i;
bfs();
}
int main()
{
prepare();
char a[],b[],c[];
bool tom[];
int i,j,k,cur;
while(gets(a))
{
k=strlen(a);
b[]='\0';
for(i=,j=;i<k;i++)
{
if(a[i]=='x' || (a[i]>=''&&a[i]<=''))
{
if(a[i]=='x')
b[j]='';
else b[j]=a[i];
j++;
}
}
memset(tom,false,sizeof(tom));
for(i=;i<=;i++)
{
tom[b[i]-'']=true;
}
for(i=;i<=;i++)
{
if(tom[i]==false)
break;
}
if(i<=){printf("unsolvable\n");continue;}
cur=ktzk(b);
if(hash[cur].flag==false)
{
printf("unsolvable\n");
continue;
}
k=;
while(hash[cur].father!=cur)
{
c[k]=hash[cur].str;
k++;
cur=hash[cur].father;
}
for(i=;i<=k-;i++)
{
if(c[i]=='u')printf("d");
if(c[i]=='d')printf("u");
if(c[i]=='l')printf("r");
if(c[i]=='r')printf("l");
}
printf("\n");
}
return ;
}

hdu 1043 八数码问题的更多相关文章

  1. Eight POJ - 1077 HDU - 1043 八数码

    Eight POJ - 1077 HDU - 1043 八数码问题.用hash(康托展开)判重 bfs(TLE) #include<cstdio> #include<iostream ...

  2. HDU 1043 八数码(A*搜索)

    在学习八数码A*搜索问题的时候须要知道下面几个点: Hash:利用康托展开进行hash 康托展开主要就是依据一个序列求这个序列是第几大的序列. A*搜索:这里的启示函数就用两点之间的曼哈顿距离进行计算 ...

  3. HDU 1043 八数码(八境界)

    看了这篇博客的讲解,挺不错的.http://www.cnblogs.com/goodness/archive/2010/05/04/1727141.html 判断无解的情况(写完七种境界才发现有直接判 ...

  4. HDU 1043 八数码问题的多种解法

    一.思路很简单,搜索.对于每一种状态,利用康托展开编码成一个整数.于是,状态就可以记忆了. 二.在搜索之前,可以先做个优化,对于逆序数为奇数的序列,一定无解. 三.搜索方法有很多. 1.最普通的:深搜 ...

  5. HDU 1043 八数码 Eight A*算法

    Eight Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Subm ...

  6. Eight hdu 1043 八数码问题 双搜

    Eight Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Subm ...

  7. hdu 1043 Eight 经典八数码问题

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1043 The 15-puzzle has been around for over 100 years ...

  8. HDU 1043 Eight(八数码)

    HDU 1043 Eight(八数码) 00 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)   Problem Descr ...

  9. Hdu 1043 Eight (八数码问题)

    题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=1043 题目描述: 3*3的格子,填有1到8,8个数字,还有一个x,x可以上下左右移动,问最终能否移动 ...

随机推荐

  1. TCP BBR - 如何安装、启动、停止BBR!

    TCP BBR从Linux 4.9 内核开始,就作为它内核的一部分存在了,如果想使用BBR,那么首先就是判断内核版本是否大于4.9,如果符合版本标准,那么直接启动BBR就可以了,如果低于4.9,升级内 ...

  2. Mac 切换到行首和行末的方法

    苹果笔记本没有home键和end键 但是使用 command + 方向键左键可以回到行首, command + 方向键右键可以去到行末

  3. 二叉查找树的实现——c++

    二叉查找树的c++实现: 1. 节点和二叉查找树的定义 1.1 二叉查找树节点 template <class T> class BSTNode{ public: T key; // 关键 ...

  4. 设置jade高亮

    来自:https://segmentfault.com/a/1190000002896247 打开sublime3,再打开 view > show console,把下列代码复制到console ...

  5. 【JavaScript】10个重要知识点

    1. 立即执行函数 立即执行函数,即Immediately Invoked Function Expression (IIFE),正如它的名字,就是创建函数的同时立即执行.它没有绑定任何事件,也无需等 ...

  6. Python 3 虚拟机端口映射 VMware

    编程语言(以Python 3 为例子) 编程语言最开始就是机器语言(低级语言,计算机能认识:0101... 最底层的指令代码),学习很困难.现在用机器语言的很少,芯片厂商的技术人员来编程之外:发展下来 ...

  7. Java的GC

    垃圾收集 在探究Jvm的过程中,有两个点特别需要关注,一是:内存的使用,分配策略,而这一点是在前一篇博客已经介绍过了. 二是:内存的回收.也就是这一篇博客所要探究的关键点. 内存回收需要关注的几个点: ...

  8. POJ 2336

    #include <iostream> using namespace std; int main() { //freopen("acm.acm","r&qu ...

  9. [原创] rtrim() 格式化中文问题

    先看以下代码 var_dump(rtrim("互联网产品.", ".")); 我们以为会得到结果 "互联网产品", 但实际上获得的是 &qu ...

  10. Eclipse *版本(图文详解)

    不多说,直接上干货! 关于Eclipse的版本介绍 Eclipse Standard 该版本是eclipse最基础的版本,适合Java se个人开发者.或希望根据自己需求配置插件的开发者使用. Ecl ...