多米诺骨牌
Time Limit:10000MS Memory Limit:65536K
Total Submit:238 Accepted:78
Case Time Limit:1000MS
Description
Input
输入文件的第一行是一个正整数n(1≤n≤1000),表示多米诺骨牌数。接下来的n行表示n个多米诺骨牌的点数。每行有两个用空格隔开的正整数,表示多米诺骨牌上下方块中的点数a和b,且1≤a,b≤6。
Output
输出文件仅一行,包含一个整数。表示求得的最小旋转次数。
Sample Input
4
6 1
1 5
1 3
1 2
Sample Output
1
用F数组,翻动的最小骨牌数,可以列出如下方程:
f[j]:=min(f[j],f[j+2*(a[i]-b[i])]+1);
var
f:array[-10001..10001] of longint;
n,i,j,sum,sum1,sum2:longint;
a,b:array[0..10001] of longint;
function min(a,b:longint):longint;
begin
if a<b then exit(a)
else exit(b);
end;
begin
readln(n);
for i:=1 to n do readln(a[i],b[i]);
for i:=1 to n do
begin
inc(sum1,a[i]);
inc(sum2,b[i]);
sum:=sum+a[i]+b[i]-min(a[i],b[i]);
end;
fillchar(f,sizeof(f),127);
f[sum1-sum2]:=0;
for i:=1 to n do
begin
if a[i]>b[i] then
for j:=-sum to sum do
f[j]:=min(f[j],f[j+2*(a[i]-b[i])]+1);
if a[i]<b[i] then
for j:=sum downto -sum do
f[j]:=min(f[j],f[j+2*(a[i]-b[i])]+1);
end;
for i:=0 to sum do
if (f[i]<>f[-10000])and(f[-i]<>f[-10000]) then break;
writeln(min(f[i],f[-i]));
end.