ACM - 状压DP
LP_Cong
Python, Qt C++ Developer ACMer https://github.com/Linzecong
展开
-
POJ - 1038 Bugs Integrated, Inc.(三进制状压)
Bugs Integrated, Inc.DescriptionBugs Integrated, Inc. is a major manufacturer of advanced memory chips. They are launching production of a new six terabyte Q-RAM chip. Each chip consists o原创 2017-09-25 20:27:15 · 345 阅读 · 0 评论 -
HDU - 2280 Tetris Comes Back (状压DP)
Tetris Comes BackProblem DescriptionWorking in corporation is toilsome and rest is important. In leisure time, WisKey like to play Tetris. The Tetris game in board is N*5, and there are 8 ki原创 2017-09-20 21:05:13 · 621 阅读 · 0 评论 -
SGU - 131 Hardwood floor (状压DP)
131. Hardwood floor time limit per test: 0.25 sec. memory limit per test: 4096 KB The banquet hall of Computer Scientists' Palace has a rectangular form of the size M x N (11) rectangles (原创 2017-09-20 11:28:26 · 483 阅读 · 0 评论 -
POJ - 2411 Mondriaan's Dream(状压DP,详细解释)
Mondriaan's DreamDescriptionSquares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after producing the drawings in his 'toilet series' (where he had to use h原创 2017-09-15 19:06:34 · 451 阅读 · 0 评论 -
POJ - 2288 Islands and Bridges(状压DP,详细解释)
Islands and BridgesDescriptionGiven a map of islands and bridges that connect these islands, a Hamilton path, as we all know, is a path along the bridges such that it visits each island ex原创 2017-09-11 17:43:01 · 549 阅读 · 0 评论 -
HDU - 4352 XHXJ's LIS(数位DP+状态压缩)
XHXJ's LISProblem Description#define xhxj (Xin Hang senior sister(学姐)) If you do not know xhxj, then carefully reading the entire description is very important.As the strongest fighting fo原创 2017-10-12 14:48:00 · 332 阅读 · 0 评论 -
HDU - 5418 Victor and World(最短哈密顿回路)
Victor and WorldTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 1777 Accepted Submission(s): 837Problem DescriptionAfter trying hard for ma...原创 2018-04-24 17:47:17 · 1015 阅读 · 0 评论 -
计蒜客 AC Challenge (2018 ICPC亚洲区域赛网络赛 南京 E)(状压DP)
题目链接:https://nanti.jisuanke.com/t/30994 Dlsj is competing in a contest with n (0 < n \le 20)n(0<n≤20) problems. And he knows the answer of all of these problems.However, he can submit ii-t...原创 2018-09-01 20:53:59 · 1005 阅读 · 0 评论