Dancing links
文章平均质量分 83
KinFungYu
前SCAU ACM校队队员
展开
-
poj 3740 Easy Finding(Dancing Links 精确覆盖)
Easy FindingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 16128 Accepted: 4321DescriptionGiven a M×N matrix A. Aij ∈ {0, 1} (0 ≤ i < M, 0 ≤ j < N), co原创 2014-09-29 16:20:51 · 857 阅读 · 0 评论 -
hdu 3663 Power Stations(精确覆盖 Dancing Links 模版)
Power StationsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1899 Accepted Submission(s): 514Special JudgeProblem DescriptionThe原创 2014-09-29 23:13:48 · 1060 阅读 · 0 评论 -
hdu 2828 Lamp(重复覆盖)
LampTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 846 Accepted Submission(s): 260Special JudgeProblem DescriptionThere are seve原创 2014-10-02 23:00:45 · 824 阅读 · 0 评论 -
hdu 3498 whosyourdaddy(重复覆盖+估价函数剪枝)
whosyourdaddyTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1401 Accepted Submission(s): 699Problem Descriptionsevenzero liked原创 2014-10-04 22:52:04 · 900 阅读 · 0 评论