eight - zoj 1217 poj 1077

【eight - zoj 1217 poj 1077】的更多相关文章

eight - zoj 1217 poj 1077

学习了多位大牛的方法,看看到底能把时耗降到多少? A* // zojfulltest: 30000ms # include <stdio.h> # include <ctype.h> # include <stdlib.h> # include <string.h> # define DATA(x,i) (((x)>>((i)*))&0x7) # define ZERO(x) ((x)>>) # define F(x) ((x…

HDU 1043 & POJ 1077 Eight（康托展开+BFS+预处理）

Eight Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 30176 Accepted: 13119 Special Judge 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…

ZOJ 1542 POJ 1861 Network 网络最小生成树，求最长边，Kruskal算法

题目连接:problemId=542" target="_blank">ZOJ 1542 POJ 1861 Network 网络 Network Time Limit: 2 Seconds Memory Limit: 65536 KB Special Judge Andrew is working as system administrator and is planning to establish a new network in his com…

HDU 1043 & POJ 1077 Eight（康托展开+BFS | IDA*）

Eight Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 30176 Accepted: 13119 Special Judge 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…

Eight POJ - 1077 HDU - 1043 八数码

Eight POJ - 1077 HDU - 1043 八数码问题.用hash(康托展开)判重 bfs(TLE) #include<cstdio> #include<iostream> #include<queue> #include<cstring> using namespace std; ,,,,,,,,,}; ]; ][]; queue<int> q; //data[][9]存储上一个状态,data[][10]存储到这个状态的操作,dat…

HDU - 1043 - Eight / POJ - 1077 - Eight

先上题目: Eight Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11243 Accepted Submission(s): 3022Special Judge Problem Description The 15-puzzle has been around for over 100 years; even if you…

POJ 1077 && HDU 1043 Eight A*算法,bfs,康托展开,hash 难度:3

http://poj.org/problem?id=1077 http://acm.hdu.edu.cn/showproblem.php?pid=1043 X=a[n]*(n-1)!+a[n-1]*(n-2)!+...+a[i]*(i-1)!+...+a[1]*0! 其中,a[i]为整数,并且X=a[n]*(n-1)!+a[n-1]*(n-2)!+...+a[i]*(i-1)!+...+a[1]*0!.这就是康托展开.康拓展开可以用来表示排列状态,对于本题的9个数字的所有排列只需要9位,所有状态…