POJ 1273 Drainage Ditches

Description

Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. Thus, Farmer John has built a set of drainage ditches so that Bessie's clover patch is never covered in water. Instead, the water is drained to a nearby stream. Being an ace engineer, Farmer John has also installed regulators at the beginning of each ditch, so he can control at what rate water flows into that ditch.
Farmer John knows not only how many gallons of water each ditch can transport per minute but also the exact layout of the ditches, which feed out of the pond and into each other and stream in a potentially complex network.
Given all this information, determine the maximum rate at which water can be transported out of the pond and into the stream. For any given ditch, water flows in only one direction, but there might be a way that water can flow in a circle.

Input

The input includes several cases. For each case, the first line contains two space-separated integers, N (0 <= N <= 200) and M (2 <= M <= 200). N is the number of ditches that Farmer John has dug. M is the number of intersections points for those ditches. Intersection 1 is the pond. Intersection point M is the stream. Each of the following N lines contains three integers, Si, Ei, and Ci. Si and Ei (1 <= Si, Ei <= M) designate the intersections between which this ditch flows. Water will flow through this ditch from Si to Ei. Ci (0 <= Ci <= 10,000,000) is the maximum rate at which water will flow through the ditch.

Output

For each case, output a single integer, the maximum rate at which water may emptied from the pond.

Sample Input

5 4
1 2 40
1 4 20
2 4 20
2 3 30
3 4 10

Sample Output

50

题意：下雨天，有一个排水系统，有N条排水渠，M个水渠交叉点，每一条排水道都有单位时间水量上限。Farmer 的房子在交叉点1。小溪在交叉点n。问单位时间内最多有多少水可以从房屋流到小溪。

//===================================================================================

很明显，这是一道最大流的问题。直接打了一遍SAP就过了。。。

AC CODE

program pku_1273;

var l,g,next:array[0..410] of longint;

    en,d:array[1..200] of longint;

    vd:array[0..200] of longint;

    n,size:longint;

//============================================================================

procedure predeal;

begin

  fillchar(d,sizeof(d),0);

  fillchar(vd,sizeof(vd),0);

  fillchar(l,sizeof(l),0);

  fillchar(en,sizeof(en),0);

end;

//============================================================================

procedure ins(x,y,z:longint);

begin

  inc(size); l[size]:=y; g[size]:=z;

  next[size]:=en[x]; en[x]:=size;

end;

//============================================================================

procedure init;

var i,x,y,z,m:longint;

begin

  readln(m,n); size:=1;

  for i:=1 to m do

  begin

    readln(x,y,z);

    ins(x,y,z); ins(y,x,0);

  end;

end;

//============================================================================

function min(x,y:longint):longint;

begin

  if x<y then min:=x else min:=y;

end;

//============================================================================

function dfs(u,flow:longint):longint;

var tmp,i:longint;

begin

  if u=n then exit(flow);

  dfs:=0; i:=en[u];

  while i<>0 do

  begin

    if (g[i]>0) and (d[u]=d[l[i]]+1) then

    begin

      tmp:=dfs(l[i],min(flow-dfs,g[i]));

      dec(g[i],tmp); inc(g[i xor 1],tmp);

      inc(dfs,tmp); i:=next[i];

      if dfs=tmp then exit(dfs);

    end else i:=next[i];

  end;

  if d[1]>=n then exit;

  dec(vd[d[u]]);

  if vd[d[u]]=0 then d[1]:=n;

  inc(d[u]); inc(vd[d[u]]);

end;

//============================================================================

procedure SAP;

var ans:longint;

begin

  vd[0]:=n; ans:=0;

  while d[1]<n do inc(ans,dfs(1,maxlongint));

  writeln(ans);

end;

//============================================================================

procedure work;

begin

  predeal;

  init;

  SAP;

end;

//============================================================================

begin

  while not(seekeof) do work;

end.