DP
文章平均质量分 85
yasolx
ACMer
展开
-
UVA 11651 Krypton Number System(矩阵加速DP)
题目大意: 对于一个没有前导0,相邻位数不相同的N(2解题思路: 首先我们就可想到dp[i][j]表示得分为i,最后一位为j的方案数,转移方程为。不过由于S太大,需要使用矩阵加速。 由于转移最多(N-1)*(N-1)*N个值,所以我们的结果矩阵的边长就要有(N-1)*(N-1)*N。按照转移方程就可以构造矩阵,然后快速幂得到结果。 以N=3为例:原创 2017-07-15 17:37:31 · 643 阅读 · 0 评论 -
Codeforces 8C Looking for Order(状压DP)
C. Looking for Ordertime limit per test4 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputGirl Lena likes it when everything is原创 2017-07-30 19:30:01 · 722 阅读 · 0 评论 -
HDU 4085 Peach Blossom Spring(斯坦纳树)
Peach Blossom SpringTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2808 Accepted Submission(s): 1087Problem Description原创 2017-08-08 18:57:58 · 647 阅读 · 0 评论 -
POJ 3133 Manhattan Wiring(限制匹配的插头DP)
Manhattan WiringTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 1921 Accepted: 1130DescriptionThere is a rectangular area containing n × m cells. Tw原创 2017-08-02 20:32:07 · 462 阅读 · 0 评论 -
HDU 6076 Security Check(分情况DP)
Security CheckTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 211 Accepted Submission(s): 84Problem DescriptionIn airport o原创 2017-08-05 15:54:47 · 1145 阅读 · 0 评论 -
URAL 1519 Formula 1(插头DP)
1519. Formula 1Time limit: 1.0 secondMemory limit: 64 MBBackgroundRegardless of the fact, that Vologda could not get rights to hold the Winter Olympic games of 20**, it is well-known,原创 2017-07-31 13:52:07 · 649 阅读 · 0 评论 -
HDU 4285 circuits(回路不能嵌套的插头DP)
circuitsTime Limit: 30000/15000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1149 Accepted Submission(s): 393Problem Description Given a map of原创 2017-08-07 13:41:10 · 497 阅读 · 0 评论 -
HDU 4495 Rectangle(前缀hash)
RectangleTime Limit: 10000/10000 MS (Java/Others) Memory Limit: 65535/102400 K (Java/Others)Total Submission(s): 529 Accepted Submission(s): 195Problem DescriptionGiven a rectang原创 2017-08-14 10:40:31 · 667 阅读 · 0 评论 -
51Nod 1693 水群(打表确定转移范围优化)
1693 水群 基准时间限制:0.4 秒 空间限制:524288 KB 分值: 160 难度:6级算法题 收藏 关注 总所周知,水群是一件很浪费时间的事,但是其实在水群这件事中,也可以找到一些有意思的东西。 比如现在,bx2k就在研究怎样水表情的问题。 首先,bx2k在对话框中输入了一个表情,接下来,他可以进行三种操作。 第一种,是全选复制,把所有表情全选然后复制到剪贴板中。 第二种,原创 2017-09-06 14:23:51 · 485 阅读 · 0 评论 -
Codeforces 842C Ilya And The Tree(树上DP+因子个数估计)
C. Ilya And The Tree time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Ilya is very fond of graphs, especially trees. During his last trip t原创 2017-08-30 11:05:57 · 1385 阅读 · 4 评论 -
ZOJ 3256 Tour in the Castle(插头DP+矩阵快速幂)
Tour in the CastleTime Limit: 5 Seconds Memory Limit: 32768 KBAfter the final BOSS is defeated, the hero found that the whole castle is collapsing (very familiar scene, isn't it). Escap原创 2017-08-06 19:57:43 · 380 阅读 · 0 评论 -
POJ 1991 Turning in Homework(由大推小的区间DP)
Turning in Homework Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 1172 Accepted: 519 DescriptionBessie must turn in her homework for her C classes (1 <= C <= 1,000) at Moo U so原创 2017-09-09 21:15:55 · 819 阅读 · 0 评论 -
HDU 4899 Hero meet devil(DP套DP)
Hero meet devilTime Limit: 16000/8000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 692 Accepted Submission(s): 338Problem DescriptionThere is原创 2017-09-01 11:08:30 · 532 阅读 · 0 评论 -
WOJ 29 Werewolf(树形DP+枚举)
Input file: standard inputOutput file: standard output Time limit: 1 secondMemory limit: 512 mebibytesGenerally, ACMers play Werewolf game anywhere when they go out for any programming conte原创 2017-04-11 17:10:48 · 551 阅读 · 0 评论 -
Codeforces 813D Two Melodies(维护转移来源的DP)
D. Two Melodies time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Alice is a beginner composer and now she is ready to create another master原创 2017-10-05 14:32:53 · 627 阅读 · 0 评论 -
Codeforces 808E Selling Souvenirs(花费是倍数关系的背包)
E. Selling Souvenirs time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output After several latest reforms many tourists are planning to visit Berl原创 2017-10-13 09:36:07 · 608 阅读 · 0 评论 -
SHUoj 421 零件组装(状压DP+子状态枚举)
零件组装发布时间: 2017年7月9日 18:17 最后更新: 2017年7月9日 21:04 时间限制: 1000ms 内存限制: 128M描述现有n个零件,小Y花费了很多时间来收集它们,现在他想把零件拼在一起,拼完就可以召唤神龙了。已知零件之间存在相邻的关系,拥有相邻关系的零件在最终的组装结果中就是相邻的,并且组装过程中每次只能通过相邻关系来组合零件。小原创 2017-07-12 09:56:05 · 677 阅读 · 0 评论 -
HDU 5860 Death Sequence(DP+约瑟夫问题·改)
Death SequenceTime Limit: 16000/8000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 295 Accepted Submission(s): 123Problem DescriptionYou may heard of原创 2016-08-19 17:52:46 · 700 阅读 · 0 评论 -
HDU 4405 Aeroplane chess(概率dp)
Aeroplane chessTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3119 Accepted Submission(s): 1993Problem DescriptionHzz loves aero原创 2016-07-13 16:54:19 · 527 阅读 · 0 评论 -
HDU 5773 The All-purpose Zero (DP)
The All-purpose ZeroTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 112 Accepted Submission(s): 44Problem Description?? gets an s原创 2016-07-28 18:30:00 · 420 阅读 · 0 评论 -
POJ 2978 Colored stones(状压DP+逆向思维)
Colored stonesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1887 Accepted: 882DescriptionYou are given a row of m stones each of which has one of k di原创 2016-09-09 16:15:57 · 561 阅读 · 0 评论 -
POJ 3420 Quad Tiling(轮廓线DP+矩阵快速幂)
Quad TilingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4076 Accepted: 1856DescriptionTired of the Tri Tiling game finally, Michael turns to a more原创 2016-08-24 09:44:15 · 1180 阅读 · 1 评论 -
POJ 1678 I Love this Game!(博弈DP)
I Love this Game!Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2136 Accepted: 819DescriptionA traditional game is played between two players on a pool o原创 2016-09-02 20:22:22 · 404 阅读 · 0 评论 -
UVa 10269 & ZOJ 1232 Adventure of Super Mario(最短路+DP)
题目链接题目大意: 马里奥在救出公主后要从城堡回家。有A个村庄,B个城堡,他现在在城堡A+B,要回到家1中,给出一些地点之间的距离。不过马里奥可以进行K次快速奔跑,每次不超过距离L,而且快速奔跑不能进过城堡,快速奔跑可以瞬间跑到目的地。求回家的最短距离。解题思路: 图上dp,我们可以先用Floyd求出任意两点不经过城堡的最短距离。然后很容易想到用dp原创 2016-08-24 20:10:49 · 613 阅读 · 0 评论 -
CSUOJ 1808 地铁(用map储存DP数组的DP)
1808: 地铁Time Limit: 5 Sec Memory Limit: 128 MBSubmit: 206 Solved: 22[Submit][Status][Web Board]Description Bobo 居住在大城市 ICPCCamp。ICPCCamp 有 n 个地铁站,用 1,2,…,n 编号。 m 段双向的地铁线路连接 n 个地铁站,原创 2016-09-03 21:34:01 · 1315 阅读 · 2 评论 -
HDU 5900 QSC and Master(区间DP)
QSC and MasterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 312 Accepted Submission(s): 103Problem DescriptionEvery school ha原创 2016-09-18 22:25:22 · 438 阅读 · 0 评论 -
HDU 1712 ACboy needs your help(分组背包)
ACboy needs your helpTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6524 Accepted Submission(s): 3608Problem DescriptionACboy ha原创 2016-11-03 11:24:13 · 378 阅读 · 0 评论 -
HDU 4044 GeoDefense(树形DP+分组背包)
GeoDefenseTime Limit: 12000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1239 Accepted Submission(s): 549Problem DescriptionTower defense is a原创 2016-11-03 14:55:57 · 466 阅读 · 0 评论 -
Codeforces Gym 100548H The Problem to Make You Happy (图上博弈DP)
题目链接题目大意: 在一张有向图上Bob和Alice在两个点向前走,Bob先走,Alice再走,如果他们相遇那么Alice获胜,如果有人无路可走那么另一个获胜,如果游戏不会结束那么Bob获胜。每个人都选择最优策略。求谁会获胜。解题思路: 明显是图上博弈dp,比赛时写的代码用记忆化搜索判断游戏不会结束的方法估计时错误的,就一直WA。 其实我们原创 2016-10-04 11:02:34 · 869 阅读 · 0 评论 -
WUSTOJ 1878 金明的预算方案(有依赖的背包/树形DP)
1878: 金明的预算方案Time Limit: 1 Sec Memory Limit: 128 MB 64bit IO Format: %lldSubmitted: 10 Accepted: 7[Submit][Status][Web Board]Description金明今天很开心,家里购置的新房就要领钥匙了,新房里有一间金明自己专用的很宽敞的房间。更原创 2017-01-29 13:14:36 · 851 阅读 · 0 评论 -
HDU 3689 Infinite monkey theorem(字符串匹配+概率dp)
Infinite monkey theoremTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1730 Accepted Submission(s): 901Problem DescriptionCou原创 2017-03-30 17:14:59 · 1120 阅读 · 0 评论 -
HDU 4114 Disney's FastPass(floyd+状态压缩DP)
Disney's FastPassTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2419 Accepted Submission(s): 670Problem DescriptionDisne原创 2017-04-13 13:29:20 · 656 阅读 · 0 评论 -
HDU 4804 Campus Design(状压DP)
Campus DesignTime Limit: 15000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1235 Accepted Submission(s): 633Problem DescriptionNanjing Univ原创 2017-05-10 22:40:06 · 557 阅读 · 0 评论 -
HDU 5956 The Elder(树上斜率优化DP)
The ElderTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1098 Accepted Submission(s): 289Problem Description Once upon a time, in the mysti原创 2017-11-28 22:01:10 · 730 阅读 · 0 评论