bfs 广度搜索
左眼皮跳跳~
这个作者很懒,什么都没留下…
展开
-
POJ 3414 Pots (经典bfs )
poj 3414 两个壶倒水问题原创 2014-08-06 14:14:20 · 1065 阅读 · 1 评论 -
HDU 1429 胜利大逃亡(续)(bfs)
胜利大逃亡(续)Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6270 Accepted Submission(s): 2177Problem DescriptionIgnatius再次被魔王抓走了(搞不懂他原创 2015-07-06 13:38:44 · 762 阅读 · 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): 14184 Accepted Submission(s): 4474Special JudgeProblem D原创 2015-07-05 14:35:30 · 574 阅读 · 0 评论 -
HDU 1043 Eight(bfs+康托展开)
EightTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15216 Accepted Submission(s): 4235Special JudgeProblem DescriptionThe 15-pu原创 2015-07-05 18:48:15 · 504 阅读 · 0 评论 -
Codeforces Round #297 (Div. 2) D Arthur and Walls(bfs)
D. Arthur and Wallstime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputFinally it is a day when Arthur has eno原创 2015-03-28 10:09:40 · 686 阅读 · 0 评论 -
HDU 5012 Dice (bfs)
DiceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 98 Accepted Submission(s): 57Problem DescriptionThere are 2 special dices on原创 2014-09-14 19:37:45 · 896 阅读 · 0 评论 -
HDU1226:超级密码(BFS)
Problem DescriptionIgnatius花了一个星期的时间终于找到了传说中的宝藏,宝藏被放在一个房间里,房间的门用密码锁起来了,在门旁边的墙上有一些关于密码的提示信息:密码是一个C进制的数,并且只能由给定的M个数字构成,同时密码是一个给定十进制整数N(0注意:由于宝藏的历史久远,当时的系统最多只能保存500位密码.因此如果得到的密码长度大于500也不能用来开启房门转载 2014-08-15 15:03:12 · 615 阅读 · 0 评论 -
HDU 5025 Saving Tang Monk(bfs)
Problem Description《Journey to the West》(also 《Monkey》) is one of the Four Great Classical Novels of Chinese literature. It was written by Wu Cheng'en during the Ming Dynasty. In this novel, Monkey原创 2014-09-21 09:37:46 · 1210 阅读 · 0 评论 -
HDU 5024 Wang Xifeng's Little Plot (bfs)
Problem Description《Dream of the Red Chamber》(also 《The Story of the Stone》) is one of the Four Great Classical Novels of Chinese literature, and it is commonly regarded as the best one. This novel原创 2014-09-20 17:07:39 · 1644 阅读 · 0 评论 -
HUD 1175 bfs广度搜索
Problem Description“连连看”相信很多人都玩过。没玩过也没关系,下面我给大家介绍一下游戏规则:在一个棋盘中,放了很多的棋子。如果某两个相同的棋子,可以通过一条线连起来(这条线不能经过其它棋子),而且线的转折次数不超过两次,那么这两个棋子就可以在棋盘上消去。不好意思,由于我以前没有玩过连连看,咨询了同学的意见,连线不能从外面绕过去的,但事实上这是错的。现在已经酿成大祸,就只能将原创 2014-07-27 21:07:55 · 706 阅读 · 0 评论 -
POJ 3026 bfs+最小生成树
poj 3026 bfs+最小生成树原创 2014-08-05 20:58:18 · 733 阅读 · 0 评论 -
HDU 1885
Key TaskTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1474 Accepted Submission(s): 605Problem DescriptionThe Czech Technical Un原创 2015-07-06 14:07:06 · 796 阅读 · 0 评论