00923旅行(2012复赛模拟2).docVIP

解法： 先解决前50% 方法1：利用曼哈顿距离分别求出每个点到其他点的横和纵距离和，他们的总和就是前50%的解。 代码： for i:=0 to n-1 do for j:=i+1 to n-1 do sum:=sum+int64(m-q(y[i]))*int64(m-q(y[j]))*int64(j-i)*int64(2); for i:=0 to m-1 do for j:=i+1 to m-1 do sum:=sum+int64(n-q(x[i]))*int64(n-q(x[j]))*int64(j-i)*int64(2); 方法2：利用坐标。 代码： var n,m,i,j,kk,t:longint; c:char; ko,kl:extended; a,b:array[0..1001]of longint; fk:array[0..1000001,1..2]of longint; f:array[0..1001,0..1001]of int64; ff,f1:array[0..1001]of int64; begin readln(n,m); for i:=1 to n do begin for j:=1 to m do begin read(c); if c=. then begin {记录坐标} inc(a[i]); inc(b[j]); inc(t); fk[t,1]:=i; fk[t,2]:=j; end; end; readln; end; fillchar(f,sizeof(f),0); fillchar(ff,sizeof(ff),0); for i:=1 to n do begin {求出第i行到其他行的总距离，第i行为0} kk:=0; for j:=i+1 to n do begin f[i,j]:=abs(i-j)*a[j]; f[j,i]:=abs(i-j)*a[i]; kk:=kk+f[i,j]; end; for j:=1 to i-1 do kk:=kk+f[i,j]; ff[i]:=kk; end; fillchar(f,sizeof(f),0); for i:=1 to m do begin {求出第i列到其他列的总距离，第i列为0} kk:=0; for j:=i+1 to m do begin f[i,j]:=abs(i-j)*b[j]; f[j,i]:=abs(i-j)*b[i]; kk:=kk+f[i,j]; end; for j:=1 to i-1 do kk:=kk+f[i,j]; f1[i]:=kk; end; kl:=0; ko:=0; for i:=1 to t do begin {利用坐标求出这个点到其他点的距离和} kl:=kl+ff[fk[i,1]]+f1[fk[i,2]]; ko:=ko+(i-1); {单向边} end; writeln(kl/(ko*2+t):0:4); {ko*2+t:双向边+点的个数} end. 方法3：利用矩形。 代码： var x,y,n,m,t,ans:int64; i,j:longint; a:array[0..2000] of ansistring; begin readln(n,m); t:=n+m-2; ans:=0; for i:=1 to t do begin {枚举距离} x:=1; y:=i+1; {枚举坐标} while (x=n) do begin if (y=m) and (y0) then begin if (x1) and (y1) then inc(ans,(n-x+1)*(m-y+1)*4*i) {(x+1,y+1)的右下角有(n-x+1)*(m-y+1)个点，然后分别以这些点 为矩形的右下角点，利用对角线并且每个矩形有两条，长度为i， 再加上双向，为