网络流题,关键在于,此题求的不是饱和弧,可能存在的情况是:存在两条流量相同的并行路径,正确的做法是:把非饱和弧连上,建一个图,则一条满足条件的路径应该是两端点不连通(显然是Floyed)。
代码如下:
var
a,b,c,d:array[1..10000] of longint;
map:array[1..200,1..200] of longint;
n,m,s,t,ans:longint;
g:array[1..200,1..200] of boolean;
vh,di,dis,pre,his:array[0..200] of longint;
function sap:longint;
var
i,j,j1,aug,min,flow,tmp:longint;
flag:boolean;
begin
fillchar(vh,sizeof(vh),0); vh[0]:=n;
for i:=1 to n do begin di[i]:=1; dis[i]:=0; end;
i:=s; aug:=maxlongint; flow:=0;
while dis[s]<n do begin
his[i]:=aug; flag:=false;
for j:=di[i] to n do
if (map[i,j]>0)and(dis[j]+1=dis[i]) then begin
flag:=true; if map[i,j]<aug then aug:=map[i,j];
pre[j]:=i; i:=j;
if i=t then begin
inc(flow,aug);
while i<>s do begin
tmp:=i; i:=pre[i];
dec(map[i,tmp],aug); inc(map[tmp,i],aug);
end;
aug:=maxlongint;
end;
break;
end;
if flag then continue;
min:=n-1;
for j:=1 to n do
if (map[i,j]>0)and(dis[j]<min) then begin
j1:=j; min:=dis[j];
end;
di[i]:=j1;
dec(vh[dis[i]]); if vh[dis[i]]=0 then break;
dis[i]:=min+1; inc(vh[dis[i]]);
if i<>s then begin
i:=pre[i]; aug:=his[i];
end;
end;
sap:=flow;
end;
procedure main;
var
i,j,k:longint;
begin
fillchar(map,sizeof(map),0);
readln(n,m,s,t);
for i:=1 to m do begin
readln(a[i],b[i],c[i]);
map[a[i],b[i]]:=c[i];
map[b[i],a[i]]:=c[i];
end;
sap;
fillchar(g,sizeof(g),false);
for i:=1 to n do
for j:=1 to n do
if (map[i,j]<>0)and(map[j,i]<>0) then g[i,j]:=true;
for k:=1 to n do
for i:=1 to n do
if i<>k then
for j:=1 to n do
if (j<>i)and(j<>k) then
g[i,j]:=g[i,j] or (g[i,k] and g[k,j]);
ans:=0;
for i:=1 to m do
if (not g[a[i],b[i]])and(not g[b[i],a[i]]) then begin
inc(ans); d[ans]:=i;
end;
writeln(ans); for i:=1 to ans do writeln(d[i]);
end;
begin
main;
end.