USACO2014JAN滑雪场评级GOLDT3

const px:array[1..2] of integer=(0,1);
py:array[1..2] of integer=(1,0);
var h:array[0..250001,0..20] of longint;
n,m,x,i,t,j:longint;
sum,ans:int64;
hh,num:array[0..501,0..501] of longint;
pd,visit:array[0..250000] of boolean;
size,father,u,v,w:array[0..500000] of longint;
procedure qsort(a,b:longint);
var i,j,temp,x:longint;
begin
i:=a;
j:=b;
x:=w[(i+j) div 2];
repeat
while w[i]<x do inc(i);
while w[j]>x do dec(j);
if i<=j then
begin
temp:=w[i];
w[i]:=w[j];
w[j]:=temp;
temp:=u[i];
u[i]:=u[j];
u[j]:=temp;
temp:=v[i];
v[i]:=v[j];
v[j]:=temp;
inc(i);
dec(j);
end;
until i>j;
if i<b then qsort(i,b);
if a<j then qsort(a,j);
end;

procedure dfs(k,p:longint);
var i:longint;
begin
visit[k]:=true;
if pd[k] then
begin
ans:=ans+p;
pd[k]:=false;
end;
for i:=1 to h[k,0] do
if not visit[h[k,i]] then dfs(h[k,i],p);
end;

function can(a,b:longint):boolean;
begin
if (a<=m) and (b<=n) then
exit(True);
exit(false);
end;

function getfather(k:longint):longint;
var tip:longint;
begin
if father[k]=k then exit(k);
tip:=father[k];
father[k]:=getfather(tip);
getfather:=father[k];
end;

function check:longint;
var temp,i,t1,t2,j,k:longint;
begin
for i:=1 to n*m do
begin
father[i]:=i;
size[i]:=1;
end;

for i:=1 to sum do
begin
t1:=getfather(u[i]);
t2:=getfather(v[i]);
if t1<>t2 then begin   //如果他们不在同一个集合中，那么需要合并
if (size[t1]<t) and (size[t1]+size[t2]>=t) then dfs(t1,w[i]);   //如题解所述累加答案
if (size[t2]<t) and (size[t1]+size[t2]>=t) then dfs(t2,w[i]);
father[t2]:=t1;
size[t1]:=size[t1]+size[t2];  //合并以后的集合的结点数即为两个集合相加
inc(h[u[i],0]);                //建图
h[u[i],h[u[i],0]]:=v[i];
inc(h[v[i],0]);
h[v[i],h[v[i],0]]:=u[i];
end;
end;

end;

procedure build;
var i,j,k:longint;
begin
for i:=1 to m do
for j:=1 to n do
begin
for k:=1 to 2 do
if can(i+px[k],j+py[k]) then
begin
inc(sum);
u[sum]:=num[i,j];
v[sum]:=num[i+px[k],j+py[k]];
w[sum]:=abs(hh[i,j]-hh[i+px[k],j+py[k]]);  //建边
end;
end;
end;

begin
assign(input,‘skilevel.in‘);
assign(output,‘skilevel.out‘);
reset(input);
rewrite(output);
readln(m,n,t);
for i:=1 to m do
for j:=1 to n do
begin
read(hh[i,j]);
num[i,j]:=n*(i-1)+j;
end;
for i:=1 to m do
for j:=1 to n do
begin
read(x);
if x=1 then pd[num[i,j]]:=true;
end;
build;
qsort(1,sum);
check;
writeln(ans);
close(input);
close(output);
end.