POJ 1237 Drainage Ditches

点击打开原题地址                                                                                                                             Drainage Ditches Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 78166   Accepted: 30498 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 O utput 50 题意：给定点数，边数，每条 边的容量，以及源点，汇点，求最大流 解题思路：一道网络流的模板题，套模板就可以了。大致思路就是找到一个从源点到汇点的通路，然后找到权值最小的一段，作为这条路的最大流，然后记录下来，接着建立残余网络，然后继续找这样的路，直到找不到为止。 AC代码如下： #include<iostream> #include<queue> #include<cstring> using namespace std; int G[300][300]; int Prev[300]; bool Visited[300]; int n,m; unsigned Augment(){ int v ; deque<int> q; memset(Visited,0,sizeof(Visited)); memset(Prev,0,sizeof(Prev)); Prev[1] = 0 ; Visited[1] = 1; q.push_back(1); bool bFindPath = false; while(!q.empty()){ v = q.front(); q.pop_front(); for(int i = 1 ; i <= m ;i++){ if(G[v][i] > 0 && Visited[i] == 0){ Prev[i] =v ; Visited[i] = 1; if(i == m){ bFindPath = true ; q.clear(); break; } else q.push_back(i); } } } if(!bFindPath) return 0 ; int nMinFlow = 999999999; v = m; while(Prev[v]){ nMinFlow = min(nMinFlow,G[Prev[v]][v]); v = Prev[v]; } v = m ; while(Prev[v]){ G[Prev[v]][v] -= nMinFlow; G[v][Prev[v]] += nMinFlow; v = Prev[v]; } return nMinFlow; } int main(){ while(cin >> n >> m){ int s,e,c; memset(G,0,sizeof(G)); for(int i = 0 ;i < n ; i++){ cin >> s >> e >>c; G[s][e] += c; } unsigned int MaxFlow = 0 ; unsigned int aug ; while(aug = Augment()) MaxFlow += aug; cout << MaxFlow <<endl; } return 0 ; }