c++ 剪枝
碳酸钙的01妖精
这个作者很懒,什么都没留下…
展开
-
vector
vector vector常用于邻接表的情况 邻接表所建立空间是边数*4原创 2018-07-28 15:09:57 · 106 阅读 · 0 评论 -
POJ-1084 (IDA*)
Square DestroyerTime Limit: 1000MS Memory Limit: 10000K Total Submissions: 4577 Accepted: 2053 DescriptionThe left figure below shows a complete 3*3 grid made with 2*(3*4) (=24...原创 2018-07-28 13:29:15 · 665 阅读 · 2 评论 -
HDU-3498 (重复覆盖+IDA*)
whosyourdaddy Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1841 Accepted Submission(s): 946 Problem Description s...原创 2018-07-28 20:46:00 · 285 阅读 · 0 评论 -
精确覆盖与重复覆盖
1 1 0 1 00 0 1 0 1 -->这是精确覆盖1 1 0 1 00 0 1 1 1 -->这是重复覆盖原创 2018-07-26 13:20:10 · 556 阅读 · 0 评论 -
POJ-3074(DLX,精确覆盖)
SudokuTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 11071 Accepted: 3969 DescriptionIn the game of Sudoku, you are given a large 9 × 9 grid divided into smaller 3 ...原创 2018-07-29 23:39:21 · 569 阅读 · 0 评论 -
hihoCode-1317 : 搜索四·跳舞链(精确覆盖)
时间限制:10000ms单点时限:1000ms内存限制:256MB描述小Ho最近遇到一个难题,他需要破解一个棋局。棋局分成了n行,m列,每行有若干个棋子。小Ho需要从中选择若干行使得每一列有且恰好只有一个棋子。比如下面这样局面:其中1表示放置有棋子的格子,0表示没有放置棋子。对于上面这个问题,小Ho经过多次尝试以后得到了解为选择2、3、4行就可以做到。但...原创 2018-07-26 23:01:15 · 291 阅读 · 0 评论 -
HDU-4848 Wow! Such Conquering!(A*)
Wow! Such Conquering! Time Limit: 15000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2683 Accepted Submission(s): 815 Problem Descriptio...原创 2018-08-18 20:50:38 · 260 阅读 · 0 评论 -
PAT (Top Level) Practice 1004 To Buy or Not to Buy - Hard Version(深搜枚举+众多剪枝)
1004 To Buy or Not to Buy - Hard Version (35 分)Eva would like to make a string of beads with her favorite colors so she went to a small shop to buy some beads. There were many colorful strings of be...原创 2019-02-01 21:46:42 · 374 阅读 · 0 评论