![](https://img-blog.csdnimg.cn/20201014180756918.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
【搜索】
文章平均质量分 74
Gijkstra
Can we do better?
展开
-
HDU1584~蜘蛛牌(深搜)
蜘蛛牌Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3527 Accepted Submission(s): 1515Problem Description蜘蛛牌是windows xp操作系统自带的原创 2017-03-17 16:31:51 · 621 阅读 · 0 评论 -
NYOJ43 24 Point game(记忆化dfs)
24 Point game时间限制:3000 ms | 内存限制:65535 KB难度:5描述There is a game which is called 24 Point game.In this game , you will be given some numbers. Your task is to find an expressi原创 2017-07-24 10:52:11 · 271 阅读 · 0 评论 -
NYOJ746 整数划分(搜索||DP)
整数划分(四)时间限制:1000 ms | 内存限制:65535 KB难度:3描述 暑假来了,hrdv 又要留学校在参加ACM集训了,集训的生活非常Happy(ps:你懂得),可是他最近遇到了一个难题,让他百思不得其解,他非常郁闷。。亲爱的你能帮帮他吗? 问题是我们经常见到的整数划分,给出两个整数 n , m ,要求在 n原创 2017-07-28 14:24:46 · 273 阅读 · 0 评论 -
HDU6165 FFF at Valentine(爆搜)
FFF at ValentineTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 425 Accepted Submission(s): 212Problem DescriptionAt Vale原创 2017-08-23 09:06:18 · 564 阅读 · 1 评论 -
nyoj82 迷宫寻宝(一) (bfs)
迷宫寻宝(一) 时间限制:1000 ms | 内存限制:65535 KB 难度:4 描述 一个叫ACM的寻宝者找到了一个藏宝图,它根据藏宝图找到了一个迷宫,这是一个很特别的迷宫,迷宫里有N个编过号的门(N<=5),它们分别被编号为A,B,C,D,E.为了找到宝藏,ACM必须打开门,但是,开门之前必须在迷宫里找到这个打开这个门所需的所有钥匙(每个门都至少有一把钥匙),例如:现在A门有三把钥原创 2017-09-28 18:59:38 · 367 阅读 · 0 评论 -
nyoj 92 图像有用区域(dfs)
图像有用区域 时间限制:3000 ms | 内存限制:65535 KB 难度:4 描述 “ACKing”同学以前做一个图像处理的项目时,遇到了一个问题,他需要摘取出图片中某个黑色线圏成的区域以内的图片,现在请你来帮助他完成第一步,把黑色线圏外的区域全部变为黑色。 已知黑线各处不会出现交叉(如图2),并且,除了黑线上的点外,图像中没有纯黑色(即像素为0的点)。输入 第一行输入测试数据的原创 2017-09-28 19:04:53 · 250 阅读 · 0 评论 -
hdu5952 Counting Cliques(爆搜)
Counting CliquesTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2738 Accepted Submission(s): 994Problem Description A clique is a complete原创 2017-10-09 20:32:26 · 310 阅读 · 0 评论 -
nyoj306 走迷宫(二分+dfs)
走迷宫时间限制:1000 ms | 内存限制:65535 KB难度:5描述Dr.Kong设计的机器人卡多非常爱玩,它常常偷偷跑出实验室,在某个游乐场玩之不疲。这天卡多又跑出来了,在SJTL游乐场玩个不停,坐完碰碰车,又玩滑滑梯,这时卡多又走入一个迷宫。整个迷宫是用一个N * N的方阵给出,方阵中单元格中填充了一个整数,表示走到这个位置的难度。这个原创 2017-11-25 19:50:32 · 246 阅读 · 0 评论 -
Educational Codeforces Round 37 E. Connected Components?(bfs+思路)
E. Connected Components?time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an undirected graph原创 2018-02-03 09:56:52 · 548 阅读 · 0 评论 -
codeforce 939D. Love Rescue(dfs+贪心)
D. Love Rescuetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputValya and Tolya are an ideal pair, but they quarrel sometimes. Recently, Valya took ...原创 2018-02-19 11:26:04 · 415 阅读 · 0 评论 -
hdu5334 XYZ and Drops(BFS)
XYZ and DropsTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2111 Accepted Submission(s): 730Problem DescriptionXYZ is playing an interesting...原创 2018-03-23 17:11:15 · 268 阅读 · 1 评论 -
ZOJ1008 Gnome Tetravex(dfs)
Gnome TetravexTime Limit: 10 Seconds Memory Limit: 32768 KBHart is engaged in playing an interesting game, Gnome Tetravex, these days. In the game, at the beginning, the player is given n原创 2017-07-21 09:28:10 · 228 阅读 · 0 评论 -
POJ1128 Frame Stacking(拓扑排序+dfs)
Frame StackingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5507 Accepted: 1924DescriptionConsider the following 5 picture frames placed on an 9 x 8 a原创 2017-07-19 15:48:24 · 251 阅读 · 0 评论 -
HDU~5423 Rikka with Tree(思路+搜索)
Rikka with TreeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 893 Accepted Submission(s): 409Problem DescriptionAs we know,原创 2017-04-14 15:28:48 · 218 阅读 · 0 评论 -
BNUOJ 33993 Stealing Harry Potter's Precious(bfs+dfs)
Stealing Harry Potter's PreciousTime Limit: 1000msMemory Limit: 32768KBThis problem will be judged on HDU. Original ID: 477164-bit integer IO format: %I64d Java class name: Main原创 2017-04-30 10:34:08 · 285 阅读 · 0 评论 -
BNUOJ 33992 Lights Against Dudely(dfs)
Lights Against DudelyTime Limit: 1000msMemory Limit: 32768KBThis problem will be judged on HDU. Original ID: 477064-bit integer IO format: %I64d Java class name: MainPrev原创 2017-04-30 12:45:19 · 355 阅读 · 0 评论 -
HDU~5546 Ancient Go(暴力dfs)
Ancient GoTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2258 Accepted Submission(s): 701Problem DescriptionYu Zhou likes to原创 2017-04-25 20:27:45 · 291 阅读 · 0 评论 -
HDU4848~Wow! Such Conquering!(搜索+floyd)
Wow! Such Conquering!Time Limit: 15000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1841 Accepted Submission(s): 535Problem DescriptionTher原创 2017-03-31 13:25:30 · 317 阅读 · 0 评论 -
HDU2612 Find a way(双路BFS)
Find a wayTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11673 Accepted Submission(s): 3792Problem DescriptionPass a year le原创 2016-12-29 16:43:24 · 342 阅读 · 0 评论 -
HDU1026Ignatius and the Princess I(广搜+路径输出)
Ignatius and the Princess ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17965 Accepted Submission(s): 5764Special JudgeProblem原创 2017-01-08 18:46:05 · 362 阅读 · 0 评论 -
uva12295 Optimal Symmetric Paths(bfs+记忆化搜索)
题目链接题意:有个n*m的图,每个点都有权值,求从(1,1)走到(n,n)有最小权值的路径的方案数,要求路径必须沿次对角线对称思路:由于题目要求路径必须沿次对角线对称,那么就可以把以次对角线对称的点的权值加过来,这样只用求(1,1)到对角线的最小权路径方案数即可,就不用考虑对称的问题然后考虑如何限制路径,我们可以先求出(1,1)到每一点经过路径的最小权dp[i][j],然后以找出对角线上的最小权值...原创 2018-04-07 08:28:59 · 171 阅读 · 0 评论