随笔分类 -  BFS

HDU 4771 Stealing Harry Potter's Precious （2013杭州赛区1002题，bfs,状态压缩）
摘要：Stealing Harry Potter's PreciousTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 126Accepted Submission(s): 63Problem Description Harry Potter has some precious. For example, his invisible robe, his wand and his owl. When Hogwarts school is in h 阅读全文

posted @ 2013-11-09 22:23 kuangbin 阅读(1664) 评论(0) 推荐(0)

HDU 4707 Pet （水题）
摘要：PetTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 181Accepted Submission(s): 55Problem DescriptionOne day, Lin Ji wake up in the morning and found that his pethamster escaped. He searched in the room but didn’t find the hamster. He tried to use so 阅读全文

posted @ 2013-09-08 19:44 kuangbin 阅读(1711) 评论(0) 推荐(0)

POJ 3026 Borg Maze（bfs+最小生成树）
摘要：Borg MazeTime Limit:1000MSMemory Limit:65536KTotal Submissions:6634Accepted:2240DescriptionThe Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the galaxy. The Borg collective is the term used to describe the group consciousness of the Borg civilization. Each Borg 阅读全文

posted @ 2013-06-20 20:09 kuangbin 阅读(3151) 评论(1) 推荐(1)

HDU 4531 吉哥系列故事——乾坤大挪移 （BFS）
摘要：吉哥系列故事——乾坤大挪移Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 184Accepted Submission(s): 50Problem Description 只有进入本次马拉松复赛，你才有机会知道一个秘密：吉哥的真名叫基哥，江湖人称“叽叽哥”。 叽叽哥除了编程，还一直有个武侠梦，他最喜欢的人物是金庸小说《倚天屠龙记》中的张无忌，不仅有美人环绕，而且有一身的好武功，尤其是那神秘的乾坤大挪移，让他梦寐以求： “乾坤大挪移乃在... 阅读全文

posted @ 2013-03-30 11:23 kuangbin 阅读(1073) 评论(0) 推荐(0)

HDU 4198 Quick out of the Harbour（BFS+优先队列）
摘要：Quick out of the HarbourTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 75Accepted Submission(s): 47Problem DescriptionCaptain Clearbeard decided to go to the harbour for a few days so his crew could inspect and repair the ship. Now, a few days lat 阅读全文

posted @ 2012-04-03 21:01 kuangbin 阅读(1081) 评论(0) 推荐(0)

HDU 1026 Ignatius and the Princess I （BFS+优先队列，记录路径）
摘要：Ignatius and the Princess ITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5989Accepted Submission(s): 1816Special JudgeProblem DescriptionThe Princess has been abducted by the BEelzebub feng5166, our hero Ignatius has to rescue our pretty Princess 阅读全文

posted @ 2012-03-30 00:29 kuangbin 阅读(1374) 评论(0) 推荐(0)

移动 II (广搜，记录路径）
摘要：移动 IITime Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 27(14 users)Total Accepted: 16(14 users)Special Judge: NoDescription在坐标轴[0,500]上存在两点A,B。点A可以多次移动，每次移动需要遵循如下规则：1.向后移动一步。2.向前移动一步。3.跳到当前坐标*2的位置上。要求：利用宽搜算法编程求解从A移动到B的步数最少的方案，为使答案统一，要求搜索按照规则1、2、3的顺序进行。Input输入包含多组测试用例。每组测试用例要求输入两个整数A,B。Output按要求输 阅读全文

posted @ 2012-03-25 21:10 kuangbin 阅读(637) 评论(0) 推荐(0)

导航

JAVASCRIPT: