HDU1532 Drainage Ditches SAP+链式前向星

Drainage Ditches

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 17065    Accepted Submission(s): 8066

Problem 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

 思路：裸SAP，注意建边的过程。三种优化请忽略，验证模板
代码：

 #include<iostream>
 #include<string>
 #include<algorithm>
 #include<cstdio>
 #include<cstring>
 #include<cstdlib>
 #include<cmath>
 using namespace std;
 const int INF=0x3f3f3f3f;
 const int maxn=;
 const int maxm=maxn*maxn;
 struct edgenode {
     int c,next,to;
 }edges[maxm];
 int head[maxn];//链式前向星
 int index;
 int sapmaxflow(int source, int sink, int n) {
     //numh:用于GAP优化的统计高度数量数组;h：距离标号数组;curedges:当前弧数组;pre:前驱数组
     int numh[maxn],h[maxn],curedges[maxn],pre[maxn];
     //初始化最大流为0
     int cur_flow,flow_ans=,u,tmp,neck,i;
     memset(h,,sizeof(h));
     memset(numh,,sizeof(numh));
     memset(pre,-,sizeof(pre));
     //初始化当前弧为第一条邻接边
     for(i=;i<=n;++i) curedges[i]=head[i];
     numh[]=n;
     u=source;
     //当h[start]>=n时，网络中能够肯定出现了GAP
     while(h[source]<n) {
         if(u==sink) {
             cur_flow=INF;
             //增广成功，寻找“瓶颈”边
             for(i=source;i!=sink;i=edges[curedges[i]].to) {
                 if(cur_flow>edges[curedges[i]].c) {
                     neck=i;
                     cur_flow=edges[curedges[i]].c;
                 }
             }
             //修改路径上的容量
             for(i=source;i!=sink;i=edges[curedges[i]].to) {
                 tmp=curedges[i];
                 edges[tmp].c-=cur_flow;
                 edges[tmp^].c+=cur_flow;
             }
             flow_ans+=cur_flow;
             //下次增广从瓶颈边开始
             u=neck;
         }
         for(i=curedges[u];i!=-;i=edges[i].next) if(edges[i].c&&h[u]==h[edges[i].to]+) break;
         if(i!=-) {
             curedges[u]=i;
             pre[edges[i].to]=u;
             u=edges[i].to;
         } else {
             //GAP优化
             if(==--numh[h[u]]) break;
             curedges[u]=head[u];
             for(tmp=n,i=head[u];i!=-;i=edges[i].next) if(edges[i].c) tmp=min(tmp,h[edges[i].to]);
             //重新标号并且从当前点前驱重新增广
             h[u]=tmp+;
             ++numh[h[u]];
             if(u!=source) u=pre[u];
         }
     }
     return flow_ans;
 }
 void addedge(int u, int v, int c) {
     edges[index].to=v;
     edges[index].c=c;
     edges[index].next=head[u];
     head[u]=index++;
     edges[index].to=u;
     edges[index].c=;
     edges[index].next=head[v];
     head[v]=index++;
 }
 int main() {
     int n,m;
     while(~scanf("%d%d",&m,&n)) {
         int u,v,c;
         for(int i=;i<maxm;++i) edges[i].next=-;
         for(int i=;i<maxn;++i) head[i]=-;
         index=;
         for(int i=;i<m;++i) {
             scanf("%d%d%d",&u,&v,&c);
             addedge(u,v,c);
         }
         printf("%d\n",sapmaxflow(,n,n));
     }
     return ;
 }