广度优先搜索
文章平均质量分 84
UMR小豪
这个作者很懒,什么都没留下…
展开
-
poj3126 Prime Path
Prime PathTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16991 Accepted: 9561DescriptionThe ministers of the cabinet were quite upset by the message原创 2016-08-11 21:33:46 · 205 阅读 · 0 评论 -
hdu 1034 & poj 1077 Eight 传说中的八数码问题。真是一道神题,A*算法+康托展开
博主表示比较懒,说明什么的就直接粘过来啦。第一个A*搜索,A*是一种启发式搜索,g为已花代价,h为估计的剩余代价,而A*是根据f=g+h作为估价函数进行排列,也就是优先选择可能最优的节点进行扩展。对于八数码问题,以下几个问题需要知道1.判断有无解问题:根据逆序数直接判断有无解,对于一个八数码,依次排列之后,每次是将空位和相邻位进行调换,研究后会发现,每次调换,逆转载 2017-05-17 20:02:23 · 603 阅读 · 0 评论 -
poj3087 Shuffle'm Up
A common pastime for poker players at a poker table is to shuffle stacks of chips. Shuffling chips is performed by starting with two stacks of poker chips, S1 and S2, each stack containing C chips.原创 2017-05-17 13:40:33 · 351 阅读 · 0 评论 -
迷宫问题
定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0,};它表示一个迷宫,其中的1表示墙壁,0表示可以走的路,只能横着走或竖着走,不能斜着走,要求编程序找出从左上角到右下角的最短路线。Input一个5原创 2017-05-17 13:02:52 · 265 阅读 · 0 评论 -
poj 3279 Pots
B - PotsTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionYou are given two pots, having the volume of A and B liters respectively原创 2016-07-23 10:52:44 · 286 阅读 · 0 评论 -
HDU 1495 非常可乐
大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (SInput三个整数 : S 可乐的体积 , N 和 M是两个杯子的容量,以"0 0 0"结束。Output原创 2017-05-16 21:03:24 · 917 阅读 · 0 评论 -
UVA11624 Fire!
Fire!Joe works in a maze. Unfortunately,portions of the maze have caught on fire, and the owner of the maze neglectedto create a fire escape plan. Help Joe escape the maze.Given Joe's location原创 2017-05-16 17:57:02 · 406 阅读 · 0 评论 -
Find a way
Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Especially a good friend Merceki. Yifenfei’s home is at the c原创 2017-05-16 16:39:37 · 346 阅读 · 0 评论 -
FZU-2150 Fire Game
Fat brother and Maze are playing a kind of special (hentai) game on an N*M board (N rows, M columns). At the beginning, each grid of this board is consisting of grass or just empty and then they start原创 2017-05-16 15:33:42 · 3453 阅读 · 0 评论 -
B. Igor and his way to work
B. Igor and his way to worktime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWoken up by the alarm clock Igo原创 2017-04-24 21:01:48 · 646 阅读 · 0 评论 -
5-7 肿瘤诊断
在诊断肿瘤疾病时,计算肿瘤体积是很重要的一环。给定病灶扫描切片中标注出的疑似肿瘤区域,请你计算肿瘤的体积。输入格式:输入第一行给出4个正整数:MM、NN、LL、TT,其中MM和NN是每张切片的尺寸(即每张切片是一个M\times NM×N的像素矩阵。最大分辨率是1286\times 1281286×128);LL(\le 60≤60)是切片的张数;TT是一个整数阈值(若原创 2017-03-24 21:24:35 · 882 阅读 · 0 评论 -
C. Andryusha and Colored Balloons
C. Andryusha and Colored Balloonstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAndryusha goes through a原创 2017-03-21 17:14:42 · 521 阅读 · 0 评论 -
Paint the Grid Reloaded ZOJ - 3781
Leo has a grid with N rows and M columns. All cells are painted with either black or white initially.Two cells A and B are called connected if they share an edge and they are in the same color, or t原创 2017-01-16 17:28:06 · 341 阅读 · 0 评论 -
Catch That Cow
Catch That CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 74214 Accepted: 23395DescriptionFarmer John has been informed of the location of a fugit原创 2016-07-27 08:42:40 · 187 阅读 · 0 评论 -
poj2049 Finding Nemo
Finding NemoTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 8804 Accepted: 2069DescriptionNemo is a naughty boy. One day he went into the deep sea all原创 2016-07-27 14:43:41 · 1172 阅读 · 0 评论 -
poj2251 Dungeon Master
Dungeon MasterTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 26176 Accepted: 10198DescriptionYou are trapped in a 3D dungeon and need to find the qui原创 2016-08-11 19:32:31 · 217 阅读 · 0 评论 -
poj1426 Find The Multiple
Find The MultipleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 26508 Accepted: 10977 Special JudgeDescriptionGiven a positive integer n, write a原创 2016-08-11 20:45:04 · 255 阅读 · 0 评论 -
HDU 3567 Eight II 八数码(2)
Eight-puzzle, which is also called "Nine grids", comes from an old game. In this game, you are given a 3 by 3 board and 8 tiles. The tiles are numbered from 1 to 8 and each covers a grid. As you s原创 2017-05-18 18:02:40 · 691 阅读 · 0 评论