题意:为你两个状态,求a到b 的最小路径,要求字典序最小. 思路: 最开始想的是目标状态是变化的,所以打表应该不行,然后直接上A*,但是TLE了- -(瞬间无语) 然后看了下别人的思路,预处理出9个状态(好机智),然后打表. 因为x所在的位置只有9中,我们可以根据x的位置打表,而且不同的串可以等效替代 例: 564178x23 7568x4123 --> 123456x78 5126x3478 而且题目保证一定会有解. 所以bfs+打表,至于双向bfs,写了发现一直cuo,后来发现在反向搜索时很…

Eight II Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 130000/65536 K (Java/Others)Total Submission(s): 3449    Accepted Submission(s): 753 Problem Description Eight-puzzle, which is also called "Nine grids", comes from an old game. In…

Eight II Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 130000/65536 K (Java/Others)Total Submission(s): 4103    Accepted Submission(s): 878 Problem Description Eight-puzzle, which is also called "Nine grids", comes from an old game. In…

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3567 Eight II Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 130000/65536 K (Java/Others) Total Submission(s): 3420    Accepted Submission(s): 742 Problem Description Eight-puzzle, which is also…

对于该题可以直接预处理初始状态[0, 1, 2, 3, 4, 5, 6, 7]所有可以到达的状态,保存到达的路径,直接打印答案即可. 关于此处的状态转换:假设有初始状态为2,3,4,5,0,6,7,1,目标状态为7,1,4,5,2,3,0,6,首先把初态看做0,1,2,3,4,5,6,7,那么目标状态应该看做6,7,2,3,0,1,4,5直接查询到达状态6,7,2,3,0,1,4,5的路径即可. PS:hdu3567与这题类似. AC代码:93ms #include<cstdio> #incl…

https://cn.vjudge.net/problem/HDU-3567 #include <stdio.h>#include <math.h>#include <queue>#include <stack>#include <string.h>using namespace std; struct Node{ int s[9]; int loc;//存放0的位置 int state;//存放康托展开后的值 char d; int fa;}n…

Golden Eggs Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 304    Accepted Submission(s): 172 Problem Description There is a grid with N rows and M columns. In each cell you can choose to put a…