poj2046
Time Limit: 5000MS | Memory Limit: 65536K | |
Total Submissions: 1829 | Accepted: 829 |
Description
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
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
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
0
33
60
-1
Source
问最少需要几次操作,达到图片3的状态
#include<cstdio>
#include<cstring>
using namespace std;
const int M=;
struct data
{
char s[],e[],p[];
int ans;
}w[];
int id[M],ans;
inline int BKDRHash(char *str)
{
int hash=,q=;
while(++q<)hash=hash*+(*str++);
return((hash&0x7FFFFFFF)%M);
}
inline void insert(char *c,int i)
{
int x=BKDRHash(c);
while(id[x]>=)
{
x+=;
if(x>=M)x%=M;
}
id[x]=i;
}
inline bool cmp(char *p,char *q)
{
for(int i=;i<;++i,++p,++q)
if(*p!=*q)return ;
return ;
}
inline int find(char *c)
{
int x=BKDRHash(c);
while(id[x]>=&&cmp(c,w[id[x]].s))
{
x+=;
if(x>=M)x%=M;
}
return id[x];
}
inline void get(char &a)
{
char ch=getchar();
while (ch<''||ch>'')ch=getchar();
for(a=;ch>=''&&ch<='';ch=getchar())a=a*+ch-;
if((a==)||(a==)||(a==)||(a==))a=;
}
inline void cpy(char *p,char *q,int n)
{
for(int i=;i<n;++i,++p,++q)*p=*q;
}
inline int bfs()
{
int l=,r=,rr=,i,k,s,p,e;
do
{
cpy(w[rr].s,w[++l].s,);
for(i=;i<;++i)
if(w[l].s[(e=w[l].e[i])-]%<&&w[l].s[e-]>)
{
w[rr].s[e]=s=w[l].s[e-]+,w[rr].s[p=w[l].p[s]]=;
if((k=find(w[rr].s))<)
{
++r,++rr,cpy(w[r].e,w[l].e,),cpy(w[r].p,w[l].p,);
w[r].e[i]=p,w[r].p[s]=e,w[r].ans=w[l].ans+;
insert(w[r].s,r);
cpy(w[rr].s,w[l].s,);
}
else w[rr].s[p]=s,w[rr].s[e]=;
if(!k)return w[l].ans+;
}
}while(l<r);
return -;
}
int main()
{
int n,i,j,k;
for(i=;i<;i+=)
for(j=;j<;++j)w[].s[i+j]=(i/+)*+j+;
scanf("%d",&n);
while(n--)
{
memset(id,-,sizeof(id));
insert(w[].s,);
for(i=;i<;i+=)
for(w[].s[i]=(i/+)*+,j=;j<;++j)get(w[].s[i+j]),w[].p[w[].s[i+j]]=i+j;
if(!find(w[].s))printf("0\n");
else
{
for(k=i=;i<;i+=)
for(j=;j<;++j)
if(!w[].s[i+j])w[].e[k++]=i+j;
w[].ans=;
insert(w[].s,);
printf("%d\n",bfs());
}
}
return ;
}
poj2046的更多相关文章
- poj分类 很好很有层次感。
初期: 一.基本算法: (1)枚举. (poj1753,poj2965) (2)贪心(poj1328,poj2109,poj2586) (3)递归和分治法. ( ...
- 【转】POJ题目分类推荐 (很好很有层次感)
OJ上的一些水题(可用来练手和增加自信) (poj3299,poj2159,poj2739,poj1083,poj2262,poj1503,poj3006,poj2255,poj3094)初期: 一. ...
- 【转】ACM训练计划
[转] POJ推荐50题以及ACM训练方案 -- : 转载自 wade_wang 最终编辑 000lzl POJ 推荐50题 第一类 动态规划(至少6题, 和 必做) 和 (可贪心) (稍难) 第二类 ...
- POJ 题目分类(转载)
Log 2016-3-21 网上找的POJ分类,来源已经不清楚了.百度能百度到一大把.贴一份在博客上,鞭策自己刷题,不能偷懒!! 初期: 一.基本算法: (1)枚举. (poj1753,poj2965 ...
- (转)POJ题目分类
初期:一.基本算法: (1)枚举. (poj1753,poj2965) (2)贪心(poj1328,poj2109,poj2586) (3)递归和分治法. (4)递推. ...
- acm常见算法及例题
转自:http://blog.csdn.net/hengjie2009/article/details/7540135 acm常见算法及例题 初期:一.基本算法: (1)枚举. (poj17 ...
- poj分类
初期: 一.基本算法: (1)枚举. (poj1753,poj2965) (2)贪心(poj1328,poj2109,poj2586) (3)递归和分治法. ( ...
- 转载 ACM训练计划
leetcode代码 利用堆栈:http://oj.leetcode.com/problems/evaluate-reverse-polish-notation/http://oj.leetcode. ...
- ACM算法总结及刷题参考
参考:http://bbs.byr.cn/#!article/ACM_ICPC/11777 OJ上的一些水题(可用来练手和增加自信)(poj3299,poj2159,poj2739,poj1083,p ...
随机推荐
- Linux命令-网络命令:mail
root用户发送邮件 mail wangyunpeng 给wangyunpeng发送邮件,wangyunpeng不在线也可以收到发送的邮件 wangyunpeng用户接收邮件 mail 接收邮件 he ...
- 自实现部分string类的功能
#define _CRT_SECURE_NO_WARNINGS #include<iostream> using namespace std; class MyString { publi ...
- osgi应用使用桥接的方式打成war包部署在websphere上时遇到的与cxf相关的问题
原来我们的程序都是基于Equinox架构的,可是后面由于要实现打成war包在中间件中部署的需求,使用了eclipse官方提供的桥接方式实现. 桥接的部分后面有时间了我专门写一个文章来说,不明确的临时请 ...
- ss - float浮动模块的高度问题 解决方案
当一个Div中的子元素都是浮动元素时,该div是没有高度的.通常会带来很多困扰,解决方案如下: 低版本统配兼容: overflow: hidden; 下面是不支持低配浏览器,而且似乎该效果对 P 标签 ...
- 将json数组字符串转换为json数组对象(值是json对象的数组)
var str1 ='[{"name":"kevin","age":18},{"name":"rose&quo ...
- Visual Studio - 安装VAX
安装方法: 我的VS2013装D盘了,安装VA以后,把VA_X.dll替换到下面的程序路径中即可完成破解. C:\Users\Administrator\AppData\Local\Microsoft ...
- CSU 1329: 一行盒子
1329: 一行盒子 Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 740 Solved: 145[Submit][Status][Web Board ...
- [Delphi] 常用字符集简介
转载 http://www.cnblogs.com/yangyxd/articles/4778483.html 字符集 ANSI (ASCII)美国信息互换标准编码 GB 2312信息交换用汉字编码字 ...
- java调用c#开发的webservice
使用jdk自带的wsimport工具生成代理类 c:\Program Files\Java\jdk1..0_121\bin>wsimport -keep -encoding utf- -d d: ...
- java全局变量使用
1.在多线程的作用下,全局变量可能被多个程序使用,如果有人修改,全局变量就被修改了,导致别人使用的时候,出现问题 2.解决方法: 全局变量改为私有变量. 或者把全局变量改为final类型,只能读取,不 ...