zoukankan      html  css  js  c++  java
  • poj1273

    Drainage Ditches
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 61571   Accepted: 23621

    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


    题意:如今有m个池塘(从1到m開始编号,1为源点,m为汇点),及n条水渠,给出这n条水渠所连接的点和所能流过的最大流量。求从源点到汇点能流过的最大流量。(网络流模板题)


    代码:


    type
      node=record
        y,r,next,op:longint;
      end;
    var
      g:array [1..400] of node;
      h,level,q:array [1..400] of longint;
      i,j,m,n,ans,a,b,c,vs,vt,tot:longint;




    function min(x,y:longint):longint;
    begin
      if x<y then
      exit(x);
      exit(y);
    end;




    function dfs(v,a:longint):longint;
    var
      tmp,u,ans,value,flow:longint;
    begin
      if (v=vt) or (a=0) then exit(a);
      ans:=0;
      tmp:=h[v];
      while tmp<>-1 do
      begin
        u:=g[tmp].y;
        value:=g[tmp].r;
        if level[v]+1=level[u] then
        begin
          flow:=dfs(u,min(a,value));
          if flow<>0 then
          begin
            g[tmp].r:=g[tmp].r-flow;
            g[g[tmp].op].r:=g[g[tmp].op].r+flow;
            ans:=ans+flow;
            a:=a-flow;
            if a=0 then break;
          end;
        end;
        tmp:=g[tmp].next;
      end;
      exit(ans);
    end;




    function bfs:boolean;
    var
      u,tmp,l,f,v:longint;
    begin
      fillchar(level,sizeof(level),0);
      q[1]:=vs;
      level[vs]:=1;
      l:=1;
      f:=1;
      repeat
        v:=q[l];
        tmp:=h[v];
        while tmp<>-1 do
        begin
          u:=g[tmp].y;
          if (g[tmp].r<>0) and (level[u]=0) then
          begin
            level[u]:=level[v]+1;
            inc(f);
        &

  • 相关阅读:
    【2018.05.05 C与C++基础】C++中的自动废料收集:概念与问题引入
    【2018.04.27 C与C++基础】关于switch-case及if-else的效率问题
    【2018.04.19 ROS机器人操作系统】机器人控制:运动规划、路径规划及轨迹规划简介之一
    March 11th, 2018 Week 11th Sunday
    March 10th, 2018 Week 10th Saturday
    March 09th, 2018 Week 10th Friday
    March 08th, 2018 Week 10th Thursday
    March 07th, 2018 Week 10th Wednesday
    ubantu之Git使用
    AMS分析 -- 启动过程
  • 原文地址:https://www.cnblogs.com/lytwajue/p/7146216.html
Copyright © 2011-2022 走看看