靶形数独DancingLinksPascal源码.docVIP

program sudoku; const p:array[0..9,0..9] of integer=( (0,0,0,0,0,0,0,0,0,0), (0,1,1,1,2,2,2,3,3,3), (0,1,1,1,2,2,2,3,3,3), (0,1,1,1,2,2,2,3,3,3), (0,4,4,4,5,5,5,6,6,6), (0,4,4,4,5,5,5,6,6,6), (0,4,4,4,5,5,5,6,6,6), (0,7,7,7,8,8,8,9,9,9), (0,7,7,7,8,8,8,9,9,9), (0,7,7,7,8,8,8,9,9,9)); w:array[0..9,0..9] of integer=( (0,0,0,0,0,0,0,0,0,0), (0,6,6,6,6,6,6,6,6,6), (0,6,7,7,7,7,7,7,7,6), (0,6,7,8,8,8,8,8,7,6), (0,6,7,8,9,9,9,8,7,6), (0,6,7,8,9,10,9,8,7,6), (0,6,7,8,9,9,9,8,7,6), (0,6,7,8,8,8,8,8,7,6), (0,6,7,7,7,7,7,7,7,6), (0,6,6,6,6,6,6,6,6,6)); type link=^node; node=record i,j,k,p2:integer; up,down,left,right:link; end; var r,rt:array[1..9*9*9+1] of link; c,ct:array[1..9*9*4+1] of link; hash:array[1..9*9*4+1] of boolean; size:array[1..9*9*4+1]of integer; tmp,ans,i,j,k:integer; procedure add(i,j,k:integer); var pos,p2:integer; q:link; begin pos:=81*(i-1)+9*(j-1)+k; p2:=9*(i-1)+k; new(q); q^.i:=i; q^.j:=j; q^.k:=k; q^.p2:=p2; rt[pos]^.right:=q; q^.left:=rt[pos]; rt[pos]:=q; ct[p2]^.down:=q; q^.up:=ct[p2]; ct[p2]:=q; inc(size[p2]); p2:=9*9+9*(j-1)+k; new(q); q^.i:=i; q^.j:=j; q^.k:=k; q^.p2:=p2; rt[pos]^.right:=q; q^.left:=rt[pos]; rt[pos]:=q; ct[p2]^.down:=q; q^.up:=ct[p2]; ct[p2]:=q; inc(size[p2]); p2:=9*9*2+9*(p[i,j]-1)+k; new(q); q^.i:=i; q^.j:=j; q^.k:=k; q^.p2:=p2; rt[pos]^.right:=q; q^.left:=rt[pos]; rt[pos]:=q; ct[p2]^.down:=q; q^.up:=ct[p2]; ct[p2]:=q; inc(size[p2]); p2:=9*9*3+9*(i-1)+j; new(q); q^.i:=i; q^.j:=j; q^.k:=k; q^.p2:=p2; rt[pos]^.right:=q; q^.left:=rt[pos]; rt[pos]:=q; ct[p2]^.down:=q; q^.up:=ct[p2]; ct[p2]:=q; inc(size[p2]); end; procedure cover(pos:integer); var p,q:link; begin hash[pos]:=true; q:=c[pos]^.down; while qc[pos] do begin p:=q^.ri