Cod sursa(job #434305)

Utilizator valytgjiu91stancu vlad valytgjiu91 Data 5 aprilie 2010 16:46:35
Problema Arbore partial de cost minim Scor 0
Compilator fpc Status done
Runda Arhiva educationala Marime 1.24 kb
type muchie=record
u,v,cost:longint;
end;
graf=array[1..200000]of muchie;
var g:graf;
x,y,c:array[1..100000]of longint;
i1,i2,i3,j,i,n,m,ms,k,a,b:longint;
ct:longint;
aux:muchie;
ok:boolean;
f,h:text;

procedure divid(st,dr:longint);
 var p,i,j:longint;
 begin
 i:=st;
 j:=dr;
 p:=g[(st+dr)shr 1].cost;
 while (i<=j) do
    begin
      while (g[i].cost<p) do i:=i+1;
      while (g[j].cost>p) do j:=j-1;
     if i<=j then begin
              aux:=g[i];
              g[i]:=g[j];
              g[j]:=aux;
              i:=i+1;
              j:=j-1;
              end;
    end;
    if st<j then divid(st,j);
    if dr>i then divid(i,dr);
end;

begin
assign(f,'apm.in');
reset(f);
assign(h,'apm.out');
rewrite(h);
read(f,n,m);
for i:=1 to m do
  begin
  read(f,i1,i2,i3);
  g[i].u:=i1;
  g[i].v:=i2;
  g[i].cost:=i3;
  end;
divid(1,m);
for i:=1 to i do
c[i]:=i;
i:=1;
k:=0;
while (i<=m)and (k<n-1) do
begin
if c[g[i].u]<>c[g[i].v] then
    begin
    ct:=ct+g[i].cost;
    k:=k+1;
    a:=c[g[i].u];
    x[k]:=a;
    b:=c[g[i].v];
    y[k]:=b;
    for j:=1 to n do
    if c[j]=a then c[j]:=b;
    end;
i:=i+1;
end;
writeln(h,ct);
writeln(h,k);
for i:=1 to n-1 do
writeln(h,x[i],' ',y[i]);
close(h);
end.