Dancing Links
文章平均质量分 82
Pira
追求梦想的人,难免有些不切实际。。。
展开
-
hust 1017(Dancing Links模板题)
Exact coverSpecial JudgeTime Limit: 15 Sec Memory Limit: 128 MBSubmissions: 3837 Solved: 2086DescriptionThere is an N*M matrix原创 2011-09-20 09:35:31 · 1951 阅读 · 2 评论 -
hdu 3335 Divisibility(Dancing Links重复覆盖)
DivisibilityTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 749 Accepted Submission(s): 258Problem DescriptionAs we know,the原创 2011-10-20 20:59:50 · 1512 阅读 · 0 评论 -
hdu 4069(Dancing Links数独)
Squiggly SudokuTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 81 Accepted Su原创 2011-10-07 18:15:41 · 1688 阅读 · 0 评论 -
zoj 1031& poj 1084 (Dancing Links 重复覆盖)
Square DestroyerTime Limit: 10 Seconds Memory Limit: 32768 KBThe left figure below shows a complete 3*3 grid made with 2*(3*4)原创 2011-09-22 08:26:24 · 1697 阅读 · 0 评论 -
Spoj 1771(Dancing Links 精确覆盖变形)
SPOJ Problem Set (classical)1771. Yet Another N-Queen ProblemProblem code: NQUEENAfter solving Solution to the n Queens原创 2011-09-21 14:29:53 · 1155 阅读 · 0 评论 -
poj 3074(数独 Dancing Link精确覆盖)
SudokuTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5830 Accepted: 1839DescriptionIn t原创 2011-09-22 10:28:28 · 3056 阅读 · 5 评论 -
zoj 3122(数独 Dancing Links精确覆盖)
SudokuTime Limit: 10 Seconds Memory Limit: 32768 KBA Sudoku grid is a 16x16 grid of cells grouped in sixteen 4x4 squares, where原创 2011-09-22 11:50:08 · 1543 阅读 · 0 评论 -
zoj 3209(Dancing Links应用)
Treasure MapTime Limit: 2 Seconds Memory Limit: 32768 KBYour boss once had got many copies of a treasure map. Unfortunately, al原创 2011-09-20 15:41:31 · 1138 阅读 · 0 评论 -
fzu 1686(Dancing Links 重复覆盖)
Problem 1686 神龙的难题Accept: 224 Submit: 801Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description这是个剑与魔法的世界原创 2011-09-20 20:17:39 · 1759 阅读 · 3 评论 -
tju 3219& hdu2295(Dancing Links重复覆盖模板题)
3219. RadarTime Limit: 1.0 Seconds Memory Limit: 65536KTotal Runs: 553 Accepted Runs: 157N cities of the Java Kingdom原创 2011-09-20 19:12:33 · 1162 阅读 · 0 评论 -
我的跳舞链 Dancing Links 模板
第一个模板——精确覆盖问题题目:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=3038为什么选择这题呢,因为它既可以当作数独模板又能当成DLX模板,不是一举两得吗^ ^#includeusing namespace std;const int N=16;const int mm=N*N*N*4+N*N原创 2011-09-22 12:48:25 · 2085 阅读 · 0 评论