ACM - 深度优先搜索
LP_Cong
Python, Qt C++ Developer ACMer https://github.com/Linzecong
展开
-
HDU - 4127 Flood-it!
经典的IDA*搜索题,可用于入门IDA*算法。用dfs不断地加深搜索深度,在当前深度下如果搜到答案,那么就是最少步数。我们注意到,每次上色,可以看看与当前颜色相邻的颜色有多少种,假设有4种如图原创 2017-07-23 16:23:59 · 576 阅读 · 0 评论 -
CodeForces - 937D Sleepy Game (深搜判环)
Sleepy Gametime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPetya and Vasya arranged a game. The game runs by the following rules. Players have a d...原创 2018-03-28 22:36:10 · 394 阅读 · 0 评论 -
CodeForces - 963B Destruction of a Tree (思维题)
Destruction of a Treetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a tree (a graph with n vertices and n - 1 edges in which it's po...原创 2018-04-18 15:50:05 · 430 阅读 · 0 评论 -
HDU - 6430 Problem E. TeaTree (启发式合并)(2018 Multi-University Training Contest 10 1005)
Problem E. TeaTreeTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 28 Accepted Submission(s): 11 Problem DescriptionRecently, TeaTre...原创 2018-08-22 17:42:03 · 290 阅读 · 0 评论 -
计蒜客 BE, GE or NE(2018 ICPC亚洲区域赛网络赛 徐州 B)(记忆化搜索+思维)
In a world where ordinary people cannot reach, a boy named "Koutarou" and a girl named "Sena" are playing a video game. The game system of this video game is quite unique: in the process of playing th...原创 2018-09-10 21:00:13 · 301 阅读 · 0 评论 -
牛客国庆集训派对Day1 D-Love Live! (启发式合并+01字典树)
链接:https://www.nowcoder.com/acm/contest/201/D来源:牛客网 题目描述因为招生办的招生政策变化,Otonokizaka Academy的ACM-ICPC team面临废队危机。Honoka Kosaka,Kotori Minami,Umi Sonoda等人决定成为偶像来吸引更多的学生参加ICPC。Honoka决定选取一些动作来编舞。我们把所有...原创 2018-10-03 15:45:19 · 534 阅读 · 2 评论 -
HDU - 6251 Inkopolis (2017 CCPC FInal I)(带环树上维护颜色块数量)
InkopolisTime Limit: 24000/12000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 322 Accepted Submission(s): 80 Problem DescriptionInkopolis is the cit...原创 2018-10-11 21:19:31 · 528 阅读 · 0 评论 -
牛客国庆集训派对Day6 A-Birthday (最小费用流)
链接:https://www.nowcoder.com/acm/contest/206/A来源:牛客网 题目描述恬恬的生日临近了。宇扬给她准备了一个蛋糕。正如往常一样,宇扬在蛋糕上插了n支蜡烛,并把蛋糕分为m个区域。因为某种原因,他必须把第i根蜡烛插在第ai个区域或第bi个区域。区域之间是不相交的。宇扬在一个区域内同时摆放x支蜡烛就要花费x2的时间。宇扬布置蛋糕所用的总时间是他在每个...原创 2018-10-06 19:27:57 · 264 阅读 · 0 评论 -
CodeForces - 1042F Leaf Sets(启发式合并)
F. Leaf Setstime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an undirected tree, consisting of nn vertices.The ve...原创 2018-10-31 13:44:25 · 400 阅读 · 0 评论 -
第十六届上海大学程序设计联赛春季赛暨上海高校金马五校赛 B 合约数(启发式合并)
链接:https://www.nowcoder.com/acm/contest/91/B来源:牛客网题目描述 在埃森哲,员工培训是最看重的内容,最近一年,我们投入了 9.41 亿美元用于员工培训和职业发展。截至 2018 财年末,我们会在全球范围内设立 100 所互联课堂,将互动科技与创新内容有机结合起来。按岗培训,按需定制,随时随地,本土化,区域化,虚拟化的培训会让你快速取得成长。小埃希望能通...原创 2018-04-15 19:17:02 · 335 阅读 · 0 评论 -
“景驰科技杯”2018年华南理工大学程序设计竞赛 K 小马哥的超级盐水 (双向深搜)
链接:https://www.nowcoder.com/acm/contest/94/K来源:牛客网题目描述 小马哥有杯盐水,第杯有单位的盐和单位的水。小马哥很无聊,于是他想知道有多少种这杯盐水的非空子集,倒在一起之后盐和水的比是解题思路:双向深搜。首先我们要把公式化简下,我们把 a1/b1 ,a2/b2 想象成两个非空子集,我们期望得到 (a1+a2)/(b1+b2) == x/y那么化简...原创 2018-04-08 15:57:21 · 329 阅读 · 0 评论 -
POJ - 2044 Weather Forecast
POJ - 2044 Weather Forecast原创 2017-07-07 17:53:46 · 475 阅读 · 0 评论 -
HDU - 3974 Assign the task
解题思路:DFS把树转换成区间,然后可以通过线段树去维护这些区间,从而变为线段树问题。原创 2017-06-04 15:19:55 · 265 阅读 · 0 评论 -
HDU - 6178 Monkeys(DFS+究极输入外挂)
MonkeysProblem DescriptionThere is a tree having N vertices. In the tree there are K monkeys (K <= N). A vertex can be occupied by at most one monkey. They want to remove some edges and leav原创 2017-08-24 23:55:00 · 406 阅读 · 0 评论 -
Codeforces - 862B Mahmoud and Ehab and the bipartiteness
B. Mahmoud and Ehab and the bipartitenessMahmoud and Ehab continue their adventures! As everybody in the evil land knows, Dr. Evil likes bipartite graphs, especially trees.A tree is a conn原创 2017-09-20 11:51:07 · 1040 阅读 · 0 评论 -
HDU - 6228 Tree (2017ICPC沈阳站 深搜+思维)
TreeProblem DescriptionConsider a un-rooted tree T which is not the biological significance of tree or plant, but a tree as an undirected graph in graph theory with n nodes, labelled from原创 2017-11-12 18:57:16 · 949 阅读 · 0 评论 -
CodeForces - 918D MADMAX (DP 记忆化搜索)
MADMAXtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAs we all know, Max is the best video game player amo原创 2018-01-31 17:28:28 · 338 阅读 · 0 评论 -
CodeForces - 919D Substring (DP 记忆化搜索)
Substringtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a graph with n nodes and m directed原创 2018-02-01 00:29:28 · 287 阅读 · 0 评论 -
CodeForces - 931D Peculiar apple-tree(深搜)
Peculiar apple-treetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn Arcady's garden there grows a peculiar apple-tree that fruits one time per ye...原创 2018-03-05 11:39:32 · 827 阅读 · 0 评论 -
Gym - 101972B Updating the Tree (深搜+合并)
B. Updating the Treetime limit per test1.5 smemory limit per test256 MBinputstandard inputoutputstandard outputA rooted tree is a tree with a countable number of nodes, in which a pa...原创 2018-11-08 16:49:54 · 477 阅读 · 0 评论