随笔分类 -  状压dp

摘要：Paid Roads Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7996 Accepted: 2982 Description A network of m roads connects N cities (numbered 阅读全文

摘要：DNA Laboratory Time Limit: 5000MS Memory Limit: 30000K Total Submissions: 2892 Accepted: 516 Description Background Having started to build his own DN 阅读全文

摘要：Rectangular Covering Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 2776 Accepted: 790 Description n points are given on the Cartesian pla 阅读全文

摘要：Corn Fields Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 18381 Accepted: 9678 Description Farmer John has purchased a lush new rectangul 阅读全文

摘要：Arrange the Bulls Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 5427 Accepted: 2069 Description Farmer Johnson's Bulls love playing baske 阅读全文

摘要：题意：给定n*m格子,每个格子被染成了黑色或者白色，现在要用1*2的砖块覆盖这些格子，块与块不得重叠,且覆盖所有的白色格子,但不覆盖任意一个黑色格子，求一共有多少种覆盖方法。 思路：书上给的思路太巧妙以至于一时无法参透，于是找了一些相关的铺砖问题的解法，在此思路上改进了一下。具体思路可以参考http 阅读全文

摘要：Contest Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1777 Accepted Submission(s): 719 Problem 阅读全文

摘要：题意：有n个城市，有p条单向路径，连通n个城市，旅行商从0城市开始旅行，那么旅行完所有城市再次回到城市0至少需要旅行多长的路程。 思路：n较小的情况下可以使用状态压缩dp，设集合S代表还未经过的城市的集合，那么dp[S][v]:当前旅行商还有集合S中的城市没有旅行，并且在城市v时走过的所有路径长度 阅读全文

摘要：Traveling by Stagecoach Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 3293 Accepted: 1253 Special Judge Description Once upon a time, the 阅读全文