Jip J. Dekker
fad1b07018
git-subtree-dir: software/minizinc git-subtree-split: 4f10c82056ffcb1041d7ffef29d77a7eef92cf76
40 lines
1.5 KiB
MiniZinc
40 lines
1.5 KiB
MiniZinc
%% 奇偶排序
|
||
%% y是x的有序版本，所有的真都在假之前
|
||
predicate oesort(array[int] of var bool:x, array[int] of var bool:y)=
|
||
let { int: c = card(index_set(x)) } in
|
||
if c == 1 then x[1] == y[1]
|
||
elseif c == 2 then comparator(x[1],x[2],y[1],y[2])
|
||
else
|
||
let {
|
||
array[1..c div 2] of var bool:xf = [x[i] | i in 1..c div 2],
|
||
array[1..c div 2] of var bool:xl = [x[i] | i in c div 2 +1..c],
|
||
array[1..c div 2] of var bool:tf,
|
||
array[1..c div 2] of var bool:tl } in
|
||
oesort(xf,tf) /\ oesort(xl,tl) /\ oemerge(tf ++ tl, y)
|
||
endif;
|
||
|
||
%% 奇偶合并
|
||
%% y 是 x的有序版本，所有的真都在假之前
|
||
%% 假设 x的前一半是有序的，后一半也是
|
||
predicate oemerge(array[int] of var bool:x, array[int] of var bool:y)=
|
||
let { int: c = card(index_set(x)) } in
|
||
if c == 1 then x[1] == y[1]
|
||
elseif c == 2 then comparator(x[1],x[2],y[1],y[2])
|
||
else
|
||
let { array[1..c div 2] of var bool:xo =
|
||
[ x[i] | i in 1..c where i mod 2 == 1],
|
||
array[1..c div 2] of var bool:xe =
|
||
[ x[i] | i in 1..c where i mod 2 == 0],
|
||
array[1..c div 2] of var bool:to,
|
||
array[1..c div 2] of var bool:te } in
|
||
oemerge(xo,to) /\ oemerge(xe,te) /\
|
||
y[1] = to[1] /\
|
||
forall(i in 1..c div 2 -1)(
|
||
comparator(te[i],to[i+1],y[2*i],y[2*i+1])) /\
|
||
y[c] = te[c div 2]
|
||
endif;
|
||
|
||
% 比较器 o1 = max(i1,i2), o2 = min(i1,i2)
|
||
predicate comparator(var bool:i1,var bool:i2,var bool:o1,var bool:o2)=
|
||
(o1 = (i1 \/ i2)) /\ (o2 = (i1 /\ i2));
|