const 
  nv=100;
type
  r=record
      vex1,vex2:1..nv;
      w:longint;
    end;
  set1=set of 1..nv;
  settype=array[1..nv] of set1;
var
  n,l,q,a,b:integer;
  stev:settype;
  ans:longint;
  m:array[1..nv*nv] of r;
procedure init;
var
  i,j:integer;
begin
  readln(n);
  l:=0;
  ans:=0;
  for i:=1 to n do
    begin
      for j:=1 to n do
        begin
          inc(l);
          m[l].vex1:=i;
          m[l].vex2:=j;
          read(m[l].w);
        end;
      readln;
    end;
  readln(q);
  for i:=1 to q do
    begin
      readln(a,b);
      m[(a-1)*n+b].w:=0;
    end;
end;
procedure sort;
var
  i,j:integer;
  k:r;
begin
  for i:=1 to l-1 do
    for j:=i+1 to l do
      if m[i].w>m[j].w then
        begin
          k:=m[i];
          m[i]:=m[j];
          m[j]:=k;
        end;
end;
function find(var setv:settype;vex:integer):integer;
var
  i:integer;
begin
  i:=1;
  while (i<=nv)and(not(vex in setv[i])) do inc(i);
  if i<=nv then find:=i
           else find:=0;
end;
procedure kruskal(var setv:settype);
var
  i,n,u,v,u1,v1,k:integer;
begin
  k:=1;
  n:=nv;
  for i:=1 to nv do setv[i]:=[i];
  while (l>1)and(k<=l) do
    begin
      u:=m[k].vex1;
      v:=m[k].vex2;
      u1:=find(stev,u);
      v1:=find(stev,v);
      if u1<>v1 then
        begin
          inc(ans,m[k].w);
          stev[u1]:=stev[u1]+stev[v1];
          stev[v1]:=[];
          dec(l);
        end;
      inc(k);
    end;
end;
begin
  while not eof do
    begin
      init;
      sort;
      kruskal(stev);
      writeln(ans);
    end;
end.

• pacal……看不懂。。。汗。 (1811) yangguo981 2006-05-09 00:56:07
• 孩子，用Ｃ (1811) Sempr 2006-05-09 09:09:47
• 孩子，用Ｃ吧！ (1811) Sempr 2006-05-09 09:10:02
  • 看清楚这个帖的年份…… (0) frkstyc 2006-05-09 09:15:12
    • 汗死，不过我上一个人更应该看清楚，谁让他先回的？ (0) Sempr 2006-05-09 09:19:21
  • Re:孩子，用Ｃ吧！ (11) ACM06021fly 2006-07-27 16:21:08
    • Re:孩子，用Ｃ吧！ (15) wywcgs 2006-07-27 17:00:00
      • 哥们 还是手工算吧 (0) MoonSlash 2006-08-22 11:14:03
  • 大哥 用BASIC吧 (0) TheBeet 2006-08-22 10:57:11
    • 爷用汇编写个交 (0) f1ymouse 2006-08-22 15:07:17
      • 01010011001110001010010100101111000110101001100010100110011100010100101001011110001010011001110001010010100101111000110101001100 机器码 (0) TheBeet 2006-08-22 16:14:16
• 这明明是kruskal (0) yiyiyi4321 2006-08-22 10:19:34
  • -_- 这明明是无穷年以前的帖子 (0) wywcgs 2006-08-22 10:24:34
    • 无穷 == 1 (0) yiyiyi4321 2006-08-22 10:38:56
• 怎么现在才被顶。。汗 (0) JiangLY 2006-08-23 00:10:33