状压DP
文章平均质量分 88
mrcoderrev
C
展开
-
hdu 4529 郑厂长系列故事――N骑士问题(状压DP+滚动数组->求给定棋子的所有方法数)
郑厂长系列故事――N骑士问题Time Limit:3000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription 郑厂长不是正厂长 也不是副厂长 他根本就不是厂长 还是那个腾讯公司的码农 一个业余时间喜欢下棋的原创 2017-11-08 11:53:33 · 309 阅读 · 0 评论 -
HDU 1438 钥匙计数之一(状压DP->四维数组求满足要求的状态的方法数)
钥匙计数之一Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription一把锁匙有N个槽,槽深为1,2,3,4。每锁匙至少有3个不同的深度且至少有1对相连的槽其深度之差为3。求这样的锁匙的总数。Inp原创 2017-11-08 11:54:16 · 287 阅读 · 0 评论 -
HDU 3001 Travelling(状压DP->TSP+多进制)
TravellingTime Limit:3000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionAfter coding so many days,Mr Acmer wants to have a good rest.So travel原创 2017-11-08 11:54:48 · 187 阅读 · 0 评论 -
POJ 3254(经典状压DP->求可以放置的方法数)@
Corn FieldsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 13642 Accepted: 7160DescriptionFarmer John has purchased a lush new rectangular pasture com原创 2017-11-08 11:55:39 · 232 阅读 · 0 评论 -
POJ 2288 Islands and Bridges(状压DP->多种限制条件的TSP)
Islands and BridgesTime Limit:4000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionGiven a map of islands and bridges that connect these islands原创 2017-11-08 11:55:48 · 296 阅读 · 0 评论 -
HDU 2809(状压DP->多种限制条件的TSP)
God of WarTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionAt 184~280 A.D ,there were many kingdoms in China. Three strongest amo原创 2017-11-08 11:56:17 · 424 阅读 · 0 评论 -
FZU 2218 Simple String Problem (状压DP解决集合不相同元素问题)
Recently, you have found your interest in string theory. Here is an interesting question about strings.You are given a string S of length n consisting of the first k lowercase letters.You are requ原创 2017-04-03 21:53:25 · 189 阅读 · 0 评论 -
poj 1085 Triangle War (状压DP+记忆化搜索+博弈)
Triangle War is a two-player game played on the following triangular grid: Two players, A and B, take turns filling in any dotted line connecting two dots, with A starting first. Once a line is原创 2017-03-19 09:57:57 · 247 阅读 · 0 评论 -
hiho 1486 物品价值(状压DP->异或技巧)
#1486 : 物品价值时间限制:10000ms单点时限:1000ms内存限制:256MB描述小Hi现在有n个物品,每个物品都有一个价值。并且这n个物品总共有m个不同的属性,每个物品都具有其中若干属性。小Ho要从中选出若干物品,满足每个属性都正好有奇数个物品拥有,且被选出的物品价值总和最大。你能帮助小Ho完成任务么?输入原创 2017-03-26 16:24:50 · 408 阅读 · 0 评论 -
uva 11825(状压DP->求并集为全集的最大组数)@
Hackers' CrackdownTime Limit:5000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescription题目大意:(黑客的攻击)假设你是一个黑客,侵入了了一个有着n台计算机(编号为0,1,…,n-1)的网原创 2016-10-05 09:31:44 · 182 阅读 · 0 评论 -
HDU 3182 Hamburger Magi(状压DP解决有顺序背包问题)
Hamburger MagiTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionIn the mysterious forest, there is a group of Magi. Most of them l原创 2016-10-05 11:29:11 · 314 阅读 · 0 评论 -
hdu 3217 Health(状压DP大水题->求一个集合的所有子集和的最大值)
HealthTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionUnfortunately YY gets ill, but he does not want to go to hospital. His gir原创 2016-10-05 15:48:43 · 195 阅读 · 0 评论 -
hdu 4568 Hunter(当状压DP遇到最短路+逆序TSP)
HunterTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription One day, a hunter named James went to a mysterious area to find the tr原创 2016-10-07 10:50:03 · 167 阅读 · 0 评论 -
hdu 4049 Tourism Planning(状压DP->背包)
Tourism PlanningTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionSeveral friends are planning to take tourism during the next hol原创 2016-10-09 16:07:45 · 173 阅读 · 0 评论 -
light oj 1021 - Painful Bases(状压DP解决全排列余数为定值的问题)
1021 - Painful Bases PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBAs you know that sometimes base conversion is a painful tas原创 2017-11-14 17:51:44 · 269 阅读 · 1 评论 -
HDU 4539 郑厂长系列故事――排兵布阵(状压DP+滚动数组->求可放棋子最大数量)
郑厂长系列故事――排兵布阵Time Limit:5000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription 郑厂长不是正厂长 也不是副厂长 他根本就不是厂长 事实上 他是带兵打仗的团长 一天,郑原创 2017-11-08 11:52:49 · 260 阅读 · 0 评论 -
light oj 1011 - Marriage Ceremonies
1011 - Marriage Ceremonies PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBYou work in a company which organizes marriages. Marr原创 2017-11-08 11:52:10 · 96 阅读 · 0 评论 -
POJ 2441 Arrange the Bulls(状压+01背包->求方法数)
Arrange the BullsTime Limit:4000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionFarmer Johnson's Bulls love playing basketball very much. But non原创 2016-10-13 21:51:22 · 328 阅读 · 0 评论 -
hdu 4352 XHXJ's LIS(数位DP)
XHXJ's LISTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription#define xhxj (Xin Hang senior sister(学姐)) If you do not know xhxj,原创 2016-10-25 10:16:57 · 257 阅读 · 0 评论 -
poj 1753 Flip Game (状压DP)@
Flip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other one is black and each piece is lying either it's bl原创 2017-03-06 15:31:17 · 208 阅读 · 0 评论 -
poj 2965 The Pilots Brothers' refrigerator (状压+bfs)
The game “The Pilots Brothers: following the stripy elephant” has a quest where a player needs to open a refrigerator.There are 16 handles on the refrigerator door. Every handle can be in one of two原创 2017-03-13 12:09:19 · 251 阅读 · 0 评论 -
zzuli 1730: 通信基站(状压DP 枚举覆盖全集的最小面积)@
1730: 通信基站Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 81 Solved: 24SubmitStatusWeb BoardDescriptionInputOutputSample Input22 1 10 04 43 100 10 0原创 2017-04-22 22:21:51 · 262 阅读 · 0 评论 -
poj 2411 Mondriaan's Dream(状压DP->求铺方格的方法数)@
Mondriaan's DreamTime Limit:10000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionSquares and rectangles fascinated the famous Dutch painter Pie原创 2017-04-24 10:30:23 · 391 阅读 · 0 评论 -
poj 3311 Hie with the Pie(状压 经典TSP)@
Hie with the PieTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionThe Pizazz Pizzeria prides itself in delivering pizzas to its cu原创 2017-04-24 11:18:43 · 291 阅读 · 0 评论 -
状压DP入门
状态压缩动态规划(简称状压dp)是另一类非常典型的动态规划,通常使用在NP问题的小规模求解中,虽然是指数级别的复杂度,但速度比搜索快,其思想非常值得借鉴。为了更好的理解状压dp,首先介绍位运算相关的知识。1.’&’符号,x&y,会将两个十进制数在二进制下进行与运算,然后返回其十进制下的值。例如3(11)&2(10)=2(10)。2.’|’符号,x|y,会将两个十转载 2016-09-30 17:34:01 · 326 阅读 · 0 评论 -
light oj 1018 - Brush (IV)(状压DP求直线容纳所有点的最少数量)
1018 - Brush (IV) PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBMubashwir returned home from the contest and got angry after s原创 2016-10-01 16:11:48 · 606 阅读 · 0 评论 -
hdu 2375 Help Bob(状压DP->优惠卷的搭配问题)
Help BobTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionBob loves Pizza but is always out of money. One day he reads in the news原创 2016-10-05 20:51:35 · 300 阅读 · 0 评论 -
hdu Kefa and Dishes(状压DP)
Kefa and DishesTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionWhen Kefa came to the restaurant and sat at a table, the waiter原创 2016-10-13 15:40:06 · 266 阅读 · 0 评论 -
light oj 1037 - Agent 47(简单状压)
1037 - Agent 47 PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBAgent 47 is in a dangerous Mission "Black Monster Defeat - 15".原创 2016-10-11 16:42:19 · 168 阅读 · 0 评论 -
hdu 6006 Engineer Assignment(状压DP)
Engineer AssignmentTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 456 Accepted Submission(s): 149Problem DescriptionIn Googl原创 2017-09-26 19:12:30 · 357 阅读 · 0 评论 -
hdu 4268 Pieces(状压DP->回文字符串的最少删除次数)@
PiecesTime Limit:3000MS Memory Limit:131072KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionYou heart broke into pieces.My string broke into pieces.But you will reco原创 2016-10-01 21:04:34 · 559 阅读 · 0 评论 -
codeforces contest 868 problem C(补集 状压)
Qualification Roundstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSnark and Philip are preparing the pro原创 2017-10-06 15:17:43 · 205 阅读 · 0 评论 -
POJ 2836 Rectangular Covering(状压DP->覆盖所有点的最小矩形面积和)
Rectangular CoveringTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionn points are given on the Cartesian plane. Now you have to u原创 2017-11-14 17:52:14 · 536 阅读 · 0 评论