- 博客(7)
- 资源 (1)
- 收藏
- 关注
原创 hdu 4034 Graph(深化最短路floyd)
题目大意:给出一个地图,已知每两个点之间的最短路径,求原图最少有多少条边。特别注意:1、这个图是有向图。2、可以找到原图就是输出最少有多少条边,否则输出-1。3、用floyd找到最短路以及进行更新。4、先得到边,再通过floyd去掉一些边,举个例子说:1->2的最短路为5,2->3的最短路为3,1->3的最短路为12,很明显1->2->3的<1->3的路径,所以1->3这条边可以去掉。5、注意输出有个Case,避免wa。Problem DescriptionEveryone knows ho
2015-11-24 20:55:29 1672
原创 hdu 2918 Tobo or not Tobo(IDA*算法)
Tobo or not ToboProblem DescriptionThe game of Tobo is played on a plastic board designed into a 3 × 3 grid with cells numbered from 1 to 9 as shown in figure (a). The grid has four dials (labeled ``A" to ``D" in the figure.) Each dial can be rotated in
2015-11-21 21:33:35 1528
原创 hdu 1560 DNA sequence(IDA*)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1560DNA sequenceTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1505 Accepted Submission(s): 730Problem DescriptionThe twenty-first century i
2015-11-18 20:12:42 1025
原创 hdu 2234 无题I (IDA*+dfs)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2234无题ITime Limit: 10000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1377 Accepted Submission(
2015-11-15 17:53:57 805
原创 hdu 1813(IDA*算法+dfs)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1813Escape from TetrisTime Limit: 12000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1078 Accept
2015-11-15 17:44:44 1945
原创 hdu Flood-it!(IDA*算法)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4127Flood-it!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1703 Accepted Submiss
2015-11-11 21:00:40 2119
原创 hdu 3567 Eight II (bfs+康托展开+预处理)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3567Eight IITime Limit: 4000/2000 MS (Java/Others) Memory Limit: 130000/65536 K (Java/Others)Total Submission(s): 1765 Accepted Submiss
2015-11-04 16:16:36 1007
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人